QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #710324 | #6128. Flippy Sequence | xunxxxx | WA | 54ms | 16180kb | C++23 | 722b | 2024-11-04 19:26:33 | 2024-11-04 19:26:33 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n;
cin>>n;
string s,t;
cin>>s>>t;
if(s==t)
{
cout<<n*(n+1)/2;
return ;
}
vector<int>f(n,0);
for(int i=0;i<n;i++) if(s[i]!=t[i]) f[i]=1;
vector<pair<int,int>>v;
for(int i=0;i<n;i++)
if(f[i]==1)
{
int j=i+1;
while(j<n&&f[j]==1) j++;
v.push_back({i,j-1});
i=j;
}
if(v.size()==1)
{
cout<<2*(n-1)<<"\n";
return ;
}
else if(v.size()==2)
{
cout<<"6\n";
return ;
}
else
{
cout<<"0\n";
return ;
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int T=1;
cin>>T;
while(T--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3496kb
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: 54ms
memory: 16180kb
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:
10 32 2 2 64 4 4 4 6 4 4 106 6 6 6 6 6 6 6 6 6 6 6 6 6 6 158 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 2110 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 2812 12 12 12 6 12 12 12 6 6 6...
result:
wrong answer 1st numbers differ - expected: '1', found: '10'