QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#636099#6128. Flippy SequenceLa5te2AC ✓283ms8012kbC++20649b2024-10-12 22:11:222024-10-12 22:11:23

Judging History

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

  • [2024-10-12 22:11:23]
  • 评测
  • 测评结果：AC
  • 用时：283ms
  • 内存：8012kb
查看
  • [2024-10-12 22:11:22]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int n,t,cnt,len;
void _search(string s1 , string s2) {
	bool b=0; //b=0´ú±íÏÖÔÚûÓÐÑÓÐøµÄ²»Í¬Çø¼ä 
	for(int i=0;i<n;i++) {
		if(s1[i]!=s2[i]) {
			if(b==1) len++;
			if(b==0) {
				len++;
				cnt++;
				b=1;
			}
		}
		if(s1[i]==s2[i] && b==1) b=0;
	}
}
void solve() {
	int ans;
	if(cnt==0) ans=n*(n+1)/2;
	if(cnt==1) {
		ans=len-1;
		ans+=n-len;
		ans*=2;
	}
	if(cnt==2) ans=6;
	cout<<ans<<endl;
}
int main()
{
	string s1,s2;
	cin>>t;
	while(t--) {
		cin>>n;
		cnt=0;
		len=0;
		cin>>s1>>s2;
		_search(s1,s2);
		solve();
	}
	return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3588kb

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: 283ms
memory: 8012kb

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
English 繁體中文 简体中文

Server Time: 2024-11-30 14:29:18 | OpenSource Project