QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#101343#6128. Flippy Sequencediyitibu#AC ✓83ms5716kbC++14714b2023-04-29 10:44:232023-04-29 10:44:25

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-29 10:44:25]
  • 评测
  • 测评结果:AC
  • 用时:83ms
  • 内存:5716kb
  • [2023-04-29 10:44:23]
  • 提交

answer

#include <iostream>
#include <bits/stdc++.h>

using namespace std ;

const int N = 1e6 +10 ;

char s[N] , t[N] ;

int main(void) {
	int T ;
	cin >>T;
	while(T --) {
		int n ;
		scanf("%d" , &n) ;
//		for(int i = 1 ; i <= n ; i ++) scanf("%1d" , &s[i]) ;
//		for(int i = 1 ; i <= n ; i ++) scanf("%1d" , &t[i]) ;
		scanf("%s%s" , s + 1 , t + 1) ; 
		int ans = 0 ;
		for(int i = 1 ; i <= n ; i ++) {
			if(s[i] == t[i]) continue ;
			int j = i ;
			while(j <= n && s[j] != t[j]) j ++ ;
			ans ++; 
			i = j - 1 ; 
		}
		if(ans > 2) puts("0") ;
		else if(ans == 0) printf("%lld\n" , 1ll * n * (n + 1) / 2) ;
		else if(ans == 1) printf("%d\n" , 2 * (n - 1)) ;
		else printf("6\n") ;
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 83ms
memory: 5716kb

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