# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43200 | baactree | 즐거운 사진 수집 (JOI13_collecting) | C++14 | 2090 ms | 44456 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;
int n, q;
int r[21], c[21];
int ro[1 << 20], co[1 << 20];
int rs[21][1 << 20], cs[21][1 << 20];
int main() {
scanf("%d%d", &n, &q);
long long cnt = 0;
for (int i = 1; i <= n; i++)
r[i] = c[i] = 1 << (n - i);
while (q--) {
int a, b;
scanf("%d%d", &a, &b);
b--;
if (a) {
//col
for (int i = 1, d = 2; i <= n; i++, d <<= 1) {
int pre = cs[i][b / d];
int now = co[b] ? pre - 1 : pre + 1;
cs[i][b / d] = now;
long long k = 0;
if (!(pre%d))c[i]--, k = 1;
if (!(now%d))c[i]++, k = -1;
cnt += r[i] * k;
}
co[b] ^= 1;
}
else {
//row
for (int i = 1, d = 2; i <= n; i++, d <<= 1) {
int pre = rs[i][b / d];
int now = ro[b] ? pre - 1 : pre + 1;
rs[i][b / d] = now;
long long k = 0;
if (!(pre%d))r[i]--, k = 1;
if (!(now%d))r[i]++, k = -1;
cnt += c[i] * k;
}
ro[b] ^= 1;
}
printf("%lld\n", cnt * 4 + 1);
}
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... |