QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #180867 | #6128. Flippy Sequence | organput# | WA | 74ms | 7144kb | C++14 | 685b | 2023-09-16 13:50:22 | 2023-09-16 13:50:22 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define enld "\n"
using namespace std;
const int N=1e5+5;
void sol()
{
int n;
cin>>n;
string a,b;
cin>>a>>b;
a=" "+a;b=" "+b;
int cnt=0;
int num=0;
for(int i=1;i<=n;i++)
{
if(a[i]!=b[i])
{
int j=i;
while(j+1<=n&&a[j+1]!=b[j+1])j++;
cnt++;
num=max(num,j-i+1);
// cout<<"*"<<i<<" "<<j<<endl;
i=j;
}
}
if(cnt==1)
{
cout<<(num-1)*2+(n-num)*2<<endl;
}
else if(cnt==2)
{
cout<<6<<endl;
}
else
{
cout<<0<<endl;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--)
{
sol();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3788kb
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: 74ms
memory: 7144kb
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 2 2 2 0 4 4 4 4 6 4 4 0 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 0 8 8 8 8 6 8 8 8 6 6 6 8 6 8 8 8 6 6 6 6 0 6 6 8 6 6 6 8 6 8 8 0 10 10 10 10 6 10 10 10 6 6 6 10 6 10 10 10 6 6 6 6 0 6 6 10 6 6 6 10 6 10 10 10 6 6 6 6 0 6 6 6 0 0 0 6 0 6 6 10 6 6 6 6 0 6 6 10 6 6 6 10 6 10 10 0 12 12 12 12 6 12 12 12 6 ...
result:
wrong answer 1st numbers differ - expected: '1', found: '0'