QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#129354 | #6128. Flippy Sequence | Energy_is_not_over# | AC ✓ | 172ms | 10132kb | C++17 | 2.1kb | 2023-07-22 16:17:58 | 2023-07-22 16:18:00 |
Judging History
answer
//
// Created by BigBag on 22.07.2023 10:55:33
//
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define all(a) a.begin(), a.end()
#define len(a) (int) (a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
#ifdef Energy_is_not_over
#define DEBUG for (bool ____DEBUG = true; ____DEBUG; ____DEBUG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define DEBUG while (false)
#define LOG(...)
#endif
const int max_n = 1000111, inf = 1000111222;
int tests, n, a[max_n];
string s, t;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> tests;
while (tests--) {
cin >> n >> s >> t;
for (int i = 0; i < n; ++i) {
a[i] = s[i] ^ t[i];
}
for (int i = n - 1; i; --i) {
a[i] ^= a[i - 1];
}
long long ans = 0;
int ones = accumulate(a, a + n, 0);
int ones_to_right = ones;
for (int i = 0; i < n; ++i) {
ones_to_right -= a[i];
ones -= a[i];
ones += 1 - a[i];
LOG(i, ones, a[i]);
ans += (ones == 1 || ones == 2);
vector<int> ways{n - 1 - i - ones_to_right, ones_to_right};
for (int other = 0; other < 2; ++other) {
if (!ways[other]) {
continue;
}
ones -= other;
ones += 1 - other;
if (ones == 1 || ones == 2) {
LOG(i, other, ones, ways[other], ans);
ans += ways[other];
}
ones -= 1 - other;
ones += other;
}
ones -= 1 - a[i];
ones += a[i];
}
cout << ans << "\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3468kb
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: 172ms
memory: 10132kb
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