QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#221450#6128. Flippy Sequenceucup-team1001#AC ✓43ms7192kbC++20812b2023-10-21 13:26:032023-10-21 13:26:03

Judging History

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

  • [2023-10-21 13:26:03]
  • 评测
  • 测评结果:AC
  • 用时:43ms
  • 内存:7192kb
  • [2023-10-21 13:26:03]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

int T;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        string s, t;
        cin >> s >> t;
        int p = 0;
        while (p < n && s[p] == t[p])p++;
        if (p == n) {
            cout << n * (n + 1) / 2 << '\n';
            continue;
        }
        while (p < n && s[p] != t[p])p++;
        while (p < n && s[p] == t[p])p++;
        if (p == n) {
            cout << 2 * (n - 1) << '\n';
            continue;
        }
        while (p < n && s[p] != t[p])p++;
        while (p < n && s[p] == t[p])p++;
        if (p == n) {
            cout << 6 << '\n';
            continue;
        }
        cout << 0 << '\n';
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 43ms
memory: 7192kb

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