QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#221417 | #6128. Flippy Sequence | ucup-team1001# | WA | 49ms | 7120kb | C++20 | 884b | 2023-10-21 13:17:21 | 2023-10-21 13:17:21 |
Judging History
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 a, b, c;
int p = 0;
while (p < n && s[p] == t[p])p++;
if (p == n) {
cout << 1 << '\n';
continue;
}
a = p;
while (p < n && s[p] != t[p])p++;
b = p - a;
while (p < n && s[p] == t[p])p++;
c = p - b;
if (p == n) {
cout << 2 * (a + b + c - 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: 1ms
memory: 3532kb
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: 49ms
memory: 7120kb
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 2 4 2 1 4 6 4 8 6 6 4 1 6 8 6 10 6 8 6 12 6 6 6 10 6 8 6 1 8 10 8 12 6 10 8 14 6 6 6 12 6 10 8 16 6 6 6 6 0 6 6 14 6 6 6 12 6 10 8 1 10 12 10 14 6 12 10 16 6 6 6 14 6 12 10 18 6 6 6 6 0 6 6 16 6 6 6 14 6 12 10 20 6 6 6 6 0 6 6 6 0 0 0 6 0 6 6 18 6 6 6 6 0 6 6 16 6 6 6 14 6 12 10 1 12 14 12 16 ...
result:
wrong answer 3rd numbers differ - expected: '3', found: '1'