Submission #43194

#TimeUsernameProblemLanguageResultExecution timeMemory
43194baactree즐거운 사진 수집 (JOI13_collecting)C++14
30 / 100
5023 ms54568 KiB
#include <bits/stdc++.h> using namespace std; int n, q; int r[21][1 << 20], c[21][1 << 20]; int rs[1 << 21], cs[1 << 21]; int ro[1 << 20], co[1 << 20]; int sz = 1 << 20; int pre[21]; void update(int idx, int val, int *tree) { idx += sz; while (idx) { tree[idx] += val; idx /= 2; } } int query(int le, int ri, int *tree) { int ret = 0; le += sz; ri += sz; while (le <= ri) { if (le & 1)ret += tree[le++]; if (!(ri & 1))ret += tree[ri--]; le /= 2; ri /= 2; } return ret; } int main() { scanf("%d%d", &n, &q); long long cnt = 0; for (int i = 1; i <= n; i++) r[i][0] = c[i][0] = 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) { pre[i] = query(b / d*d, (b / d + 1)*d - 1,cs) % d; c[i][pre[i]]--; } update(b, co[b] ? -1 : 1, cs); co[b] ^= 1; for (int i = 1, d = 2; i <= n; i++,d<<=1) { int now = query(b / d*d, (b / d + 1)*d - 1, cs) % d; c[i][now]++; long long k = 0; if (pre[i] == 0)k = 1; else if (now == 0)k = -1; cnt += r[i][0] * k; } } else { //row for (int i = 1, d = 2; i <= n; i++, d <<= 1) { pre[i] = query(b / d*d, (b / d + 1)*d - 1, rs) % d; r[i][pre[i]]--; } update(b, ro[b] ? -1 : 1, rs); ro[b] ^= 1; for (int i = 1, d = 2; i <= n; i++, d <<= 1) { int now = query(b / d*d, (b / d + 1)*d - 1, rs) % d; r[i][now]++; long long k = 0; if (pre[i] == 0)k = 1; else if (now == 0)k = -1; cnt += c[i][0] * k; } } printf("%lld\n", cnt * 4 + 1); } return 0; }

Compilation message (stderr)

collecting.cpp: In function 'int main()':
collecting.cpp:29:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &q);
                       ^
collecting.cpp:35:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...