QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692208#6128. Flippy Sequenceucup-team3294#AC ✓53ms7108kbC++23852b2024-10-31 14:04:332024-10-31 14:04:33

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 14:04:33]
  • 评测
  • 测评结果:AC
  • 用时:53ms
  • 内存:7108kb
  • [2024-10-31 14:04:33]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define x first
#define y second
void solve() {
	int n;
	cin>>n;
	string s,t;
	cin>>s>>t;
	if(s==t){
		cout<<(n+1)*n/2<<"\n";
	}else{
		s=" "+s;
		t=" "+t;
		vector<PII> a;
		for(int i=1;i<=n;i++){
			int j=i;
			if(s[i]!=t[i]){
				while(j<=n&&s[j]!=t[j]){
					j++;
				}
				a.push_back({i,j-1});
				i=j-1;
			}
		}
		if(a.size()>2){
			cout<<"0\n";
		}else if(a.size()==1){
			int ans=0;
			if(n==1){
				cout<<"0\n";
			}else{
				int l=a[0].x,r=a[0].y;
				ans=(r-l)*2;
				ans+=(n-(r-l+1))*2;
				cout<<ans<<"\n";
			}
		}else{
			int ans=6;
			cout<<ans<<"\n";
		}
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int T=1;
	cin>>T;
	while(T--) {
		solve();
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3656kb

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: 53ms
memory: 7108kb

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