QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#398814 | #6128. Flippy Sequence | SunlightZero# | AC ✓ | 37ms | 7136kb | C++17 | 987b | 2024-04-25 18:31:02 | 2024-04-25 18:31:05 |
Judging History
answer
#include <iostream>
#include <string>
using namespace std;
using ull = unsigned long long;
void solve()
{
ull n;
string s, t;
cin >> n;
cin >> s >> t;
bool flag = false;
ull cnt = 0;
for (size_t i = 0; i < n; i++)
{
if (s[i] != t[i])
{
if (!flag)
{
cnt++;
if (cnt >= 3)
{
cout << "0\n";
return;
}
flag = true;
}
}
else
{
flag = false;
}
}
if (cnt == 0)
{
cout << n * (n + 1) / 2 << '\n';
}
else if (cnt == 1)
{
cout << 2 * (n - 1) << '\n';
}
else
{
cout << 6 << '\n';
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
size_t t;
cin >> t;
while (t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
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: 37ms
memory: 7136kb
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