QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#721307#6128. Flippy Sequence0x3fffffffWA 44ms7144kbC++231.3kb2024-11-07 15:48:202024-11-07 15:48:20

Judging History

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

  • [2024-11-07 15:48:20]
  • 评测
  • 测评结果:WA
  • 用时:44ms
  • 内存:7144kb
  • [2024-11-07 15:48:20]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long

void solve() {
    int n;cin >> n;
    string a, b;
    cin >> a >> b;
    a = ' ' + a;
    b = ' ' + b;
    int l = 1, r = n;
    while (l <= n) {
        if (a[l] == b[l])l++;
        else break;
    }
    while (r >= 1) {
        if (a[r] == b[r])r--;
        else break;
    }
    if (r < l) {
        cout << 1 << "\n";return;
    }
    if (l == r) {
        cout << "0\n";return;
    }
    int ok = 0;
    for (int i = l;i <= r;i++) {
        if (a[i] == b[i]) {
            ok++;
            int j = i;
            while (a[j] == b[j])j++;
            i = j - 1;
        }
    }
    if (ok == 0) {
        int ans = r - l;
        int s = l - 1;
        ans += s * (s + 1) / 2;
        s = n - r;
        ans += s * (s + 1) / 2;
        ans *= 2;
        cout << ans << "\n";
        return;
    }
    else if (ok == 1) {
        cout << 6 << "\n";return;
    }
    else {
        cout << "0\n";return;
    }
    // cout << l << " " << r << "\n";
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif
    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: 3776kb

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: -100
Wrong Answer
time: 44ms
memory: 7144kb

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
1
0
0
2
1
0
0
4
0
6
4
4
1
0
0
8
0
6
6
6
0
6
6
6
8
6
6
6
1
0
0
14
0
6
10
10
0
6
6
6
10
6
8
8
0
6
6
6
6
0
6
6
14
6
6
6
10
6
8
8
1
0
0
22
0
6
16
16
0
6
6
6
14
6
12
12
0
6
6
6
6
0
6
6
16
6
6
6
12
6
10
10
0
6
6
6
6
0
6
6
6
0
0
0
6
0
6
6
22
6
6
6
6
0
6
6
16
6
6
6
12
6
10
10
1
0
0
32
0
6
24
24
0
6
6
6
...

result:

wrong answer 3rd numbers differ - expected: '3', found: '1'