# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787326 | qwerasdfzxcl | 즐거운 사진 수집 (JOI13_collecting) | C++17 | 873 ms | 44732 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;
typedef long long ll;
int cntR[21][2], cntC[21][2], onR[1<<21], onC[1<<21], R[21][1<<21], C[21][1<<21];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
ll ans = 1;
for (int i=1;i<=n;i++){
cntR[i][0] = 1<<(n-i);
cntC[i][0] = 1<<(n-i);
}
// int sz = 1<<n;
while(q--){
int op, x;
// scanf("%d %d", &op, &x);
cin >> op >> x;
--x;
if (op==0){
onR[x] ^= 1;
for (int i=1;i<=n;i++){
int &cnt = R[i][x>>i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |