QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #190516 | #6128. Flippy Sequence | Zhou_JK | WA | 51ms | 9264kb | C++23 | 726b | 2023-09-29 01:31:35 | 2023-09-29 01:31:36 |
Judging History
answer
#include<iostream>
#include<cstdio>
using namespace std;
const int N=1000005;
int n;
char s[N],t[N];
int a[N];
void solve()
{
cin>>n;
cin>>s;
cin>>t;
for(int i=0;i<n;i++)
if(s[i]==t[i]) a[i]=1;
else a[i]=0;
int cnt=0;
for(int i=0,j=0;i<n;i=j)
{
while(j<n&&a[i]==a[j]) j++;
if(a[i]) continue;
cnt++;
}
long long ans=0;
if(cnt==0) ans=(long long)n*(n-1)/2-n;
else if(cnt==1) ans=2*(n-1);
else if(cnt==2) ans=6;
cout<<ans<<"\n";
return;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
int T;
cin>>T;
while(T--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5668kb
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: 51ms
memory: 9264kb
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:
-1 0 -1 2 2 2 0 4 4 4 4 6 4 4 2 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 5 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 9 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 14 12 12 12 12 6 12 12 12...
result:
wrong answer 1st numbers differ - expected: '1', found: '-1'