QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#407974 | #6128. Flippy Sequence | xiaole | WA | 46ms | 6124kb | C++23 | 1.0kb | 2024-05-09 15:31:38 | 2024-05-09 15:31:38 |
Judging History
answer
#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
string a,b;
void solve(){
ll n;cin>>n;
cin>>a>>b;
if(a==b){
cout<<n+n*(n-1)/2;
return;
}
ll l=0,r=0;
ll cnt=0;
for (ll i = 0; i < n; i++)
{
if(a[i]!=b[i]) cnt++;
else {
if(cnt!=0){
if(l==0) l=cnt;
else if(r==0) r=cnt;
else {
cout<<"0\n";
return;
}
}
cnt=0;
}
}
if(cnt!=0){
if(l==0) l=cnt;
else if(r==0) r=cnt;
else {
cout<<"0\n";
return;
}
}
if(l!=0 and r!=0){
cout<<6<<"\n";
}else {
cout<<(n-1)*2<<"\n";
}
}
int main(){
ios;ll _=1;cin>>_;
while (_--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3628kb
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: 46ms
memory: 6124kb
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'