QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #91006 | #6128. Flippy Sequence | yyyyxh | WA | 112ms | 3476kb | C++17 | 644b | 2023-03-26 16:43:02 | 2023-03-26 16:43:03 |
Judging History
answer
#include <cstdio>
using namespace std;
int read(){
char c=getchar();int x=0;
while(c<48||c>57) c=getchar();
do x=(x<<1)+(x<<3)+(c^48),c=getchar();
while(c>=48&&c<=57);
return x;
}
char s[1000003];
char t[1000003];
int main(){
int tc;
scanf("%d",&tc);
while(tc--){
int n;
scanf("%d",&n);
scanf("%s",s+1);
scanf("%s",t+1);
int len=0,cnt=0;
bool on=0;
for(int i=1;i<=n;++i)
if(s[i]!=t[i]){
on=1;
++len;
}
else{
if(on) ++cnt;
on=0;
}
if(on) ++cnt;
if(cnt==1){
printf("%d\n",(len-1)<<1);
}
else if(cnt==2) puts("6");
else puts("0");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 1568kb
input:
3 1 1 0 2 00 11 5 01010 00111
output:
0 2 6
result:
ok 3 number(s): "0 2 6"
Test #2:
score: -100
Wrong Answer
time: 112ms
memory: 3476kb
input:
126648 1 0 0 1 1 0 2 01 01 2 01 11 2 10 11 2 11 00 3 011 011 3 010 110 3 011 001 3 111 001 3 001 000 3 101 000 3 011 000 3 111 000 4 1111 1111 4 1110 0110 4 0010 0110 4 1011 0111 4 1001 1011 4 0100 1110 4 0000 0110 4 0111 1001 4 1001 1000 4 1011 0010 4 0001 0100 4 1000 0101 4 0100 0111 4 1101 0110 4...
output:
0 0 0 0 0 2 0 0 0 2 0 6 2 4 0 0 0 2 0 6 2 4 0 6 6 6 2 6 4 6 0 0 0 2 0 6 2 4 0 6 6 6 2 6 4 6 0 6 6 6 6 0 6 6 2 6 6 6 4 6 6 8 0 0 0 2 0 6 2 4 0 6 6 6 2 6 4 6 0 6 6 6 6 0 6 6 2 6 6 6 4 6 6 8 0 6 6 6 6 0 6 6 6 0 0 0 6 0 6 6 2 6 6 6 6 0 6 6 4 6 6 6 6 6 8 10 0 0 0 2 0 6 2 4 0 6 6 6 2 6 4 6 0 6 6 6 6 0 6 6...
result:
wrong answer 1st numbers differ - expected: '1', found: '0'