# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991334 | gmroh06 | 즐거운 사진 수집 (JOI13_collecting) | C++14 | 730 ms | 76372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
inline void fastio() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
}
ll n, q, MAX;
ll row_tree[1 << 21], col_tree[1 << 21];
ll row[21], col[21];
void update(ll* tree, ll* cnt, ll loc) {
loc |= MAX;
tree[loc] ^= 1;
ll d = n;
while (loc > 1) {
loc >>= 1, d--;
if (tree[loc] % (1LL << n - d) == 0) cnt[d]--;
tree[loc] = tree[loc << 1] + tree[loc << 1 | 1];
if (tree[loc] % (1LL << n - d) == 0) cnt[d]++;
}
}
int main() {
fastio();
cin >> n >> q;
MAX = 1 << n;
for (ll i = 0; i <= 20; i++) {
row[i] = col[i] = 1LL << i;
}
while (q--) {
ll t, x, ans = 1 << 2 * n;
cin >> t >> x;
t ? update(col_tree, col, x - 1) : update(row_tree, row, x - 1);
for (ll i = 0; i < n; i++) {
ans += 1LL << 2 * i;
ans -= row[i] * col[i] * 4;
}
cout << ans << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |