QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692271#6128. Flippy Sequenceshabi666#AC ✓57ms17396kbC++17828b2024-10-31 14:14:282024-10-31 14:14:30

Judging History

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

  • [2024-10-31 14:14:30]
  • 评测
  • 测评结果:AC
  • 用时:57ms
  • 内存:17396kb
  • [2024-10-31 14:14:28]
  • 提交

answer

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

void solve() {
    int n;
    string s, t;
    cin >> n >> s >> t;
    s = ' ' + s;
    t = ' ' + t;
    vector<int> v(n + 1);
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if ( s[i] != t[i] ) v[i] = 1;
        if ( v[i] != v[i - 1] && v[i] == 1 ) cnt++;
    }
    // cout << cnt << endl;
    if ( cnt == 0 ) {
        cout << ( n + 1 ) * n / 2 << endl;
    } else if ( cnt == 1 ) {
        cout << (n - 1) * 2 << endl;
    } else if ( cnt == 2 ) {
        cout << 6 << endl;
    } else {
        cout << 0 << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t = 1;
    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: 3544kb

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: 57ms
memory: 17396kb

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