# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43205 | baactree | 즐거운 사진 수집 (JOI13_collecting) | C++14 | 2142 ms | 44488 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 w[2][21], o[2][1 << 20], s[2][21][1 << 20];
int main() {
scanf("%d%d", &n, &q);
long long cnt = 0;
for (int i = 1; i <= n; i++)w[0][i] = w[1][i] = 1 << (n - i);
while (q--) {
int a, b;
scanf("%d%d", &a, &b);b--;
for (int i = 1, d = 2,k=0; i <= n;cnt+=w[!a][i]*k, i++, d <<= 1,k=0) {
if (!(s[a][i][b / d] % d))w[a][i]--, k = 1;
s[a][i][b / d] += o[a][b] ? -1 : 1;
if (!(s[a][i][b / d] % d))w[a][i]++, k = -1;
}
o[a][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... |