QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#142773#6128. Flippy SequenceNyansAC ✓88ms3588kbC++14433b2023-08-19 21:31:332023-08-19 21:31:34

Judging History

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

  • [2023-08-19 21:31:34]
  • 评测
  • 测评结果：AC
  • 用时：88ms
  • 内存：3588kb
查看
  • [2023-08-19 21:31:33]
  • 提交

answer

#include <cstdio>
int T, n;
char s[1000010], t[1000010];
int main() {
	for (scanf("%d", &T); T--; ) {
		scanf("%d%s%s", &n, s + 1, t + 1);
		for (int i = 1; i <= n; ++i) s[i] ^= t[i];
		int cnt = 0;
		for (int i = 1; i <= n; ++i) if (s[i]) cnt += s[i] != s[i - 1];
		long long ans = 0;
		if (cnt == 2) ans = 6;
		if (cnt == 1) ans = n * 2 - 2;
		if (cnt == 0) ans = 1ll * n * (n + 1) / 2;
		printf("%lld\n", ans);
	}
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 88ms
memory: 3588kb

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:25:56 | OpenSource Project