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 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] = 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) {
pre[i] = query(b / d*d, (b / d + 1)*d - 1,cs) % d;
if(pre[i]==0)c[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;
if (now == 0)c[i]++;
long long k = 0;
if (pre[i] == 0)k = 1;
else if (now == 0)k = -1;
cnt += r[i] * 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;
if(pre[i]==0)r[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;
if(now==0)r[i]++;
long long k = 0;
if (pre[i] == 0)k = 1;
else if (now == 0)k = -1;
cnt += c[i] * 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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |