QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#601392 | #6128. Flippy Sequence | 122 | AC ✓ | 49ms | 7360kb | C++14 | 942b | 2024-09-29 22:52:41 | 2024-09-29 22:52:41 |
Judging History
answer
#include <bits/stdc++.h>
#define endl "\n"
#define int long long
#define PII std::pair<int, int>
#define PSS std::pair<string, string>
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define inf 0x3f3f3f3f
//#define lc p<<1
//#define rc p<<1|1
#define PIS pair<int,string>
using namespace std;
const int N=1e5+10;
void solve() {
int n;
cin>>n;
string s1,s2;
cin>>s1>>s2;
s1="!"+s1;
s2="!"+s2;
int cnt=0;
int a=0;
for(int i=1;i<=n;i++)
{
if(s1[i]==s2[i]) continue;
cnt++;int now=i;
while(s1[i]!=s2[i]&&i<=n) i++;
a=i-now;
// cout<<a<<endl;
}
// cout<<a<<endl;
if(cnt>2)
{
cout<<0<<endl;
}
else if(cnt==1)
{
int len=n-a;
int res=2*len;
res+=2*(a-1);
cout<<res<<endl;
}
else if(cnt==2)
{
cout<<6<<endl;
}
else if(cnt==0)
{
cout<<n*(n+1)/2<<endl;
}
}
signed main() {
IOS; 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: 3616kb
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: 0
Accepted
time: 49ms
memory: 7360kb
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 3 2 2 2 6 4 4 4 4 6 4 4 10 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 15 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 21 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 28 12 12 12 12 6 12 12 1...
result:
ok 126648 numbers