# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164101 | beso123 | Topovi (COCI15_topovi) | C++14 | 1994 ms | 45392 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>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define int long long
using namespace std;
map<int,int> xorr,xorc;
map<int,int> cntr,cntc;
map<pair<int,int>,int> rook;
int ans = 0;
int n,k,p;
void add(int r,int c,int x){
rook[{r,c}] ^= x;
ans -= n-cntc[xorr[r]];
ans -= n-cntr[xorc[c]];
if (xorr[r] != xorc[c]) ans++;
cntc[xorc[c]]--;
cntr[xorr[r]]--;
xorr[r] ^= x;
xorc[c] ^= x;
cntc[xorc[c]]++;
cntr[xorr[r]]++;
ans += n-cntc[xorr[r]];
ans += n-cntr[xorc[c]];
if (xorr[r] != xorc[c]) ans--;
}
main(){
scanf("%I64d%I64d%I64d",&n,&k,&p);
cntr[0] = n;
cntc[0] = n;
rep(i,k){
int r,c,x;
scanf("%I64d%I64d%I64d",&r,&c,&x);
add(r,c,x);
}
while(p--){
int r1,c1,r2,c2;
scanf("%I64d%I64d%I64d%I64d",&r1,&c1,&r2,&c2);
int x = rook[{r1,c1}];
add(r1,c1,x);
add(r2,c2,x);
printf("%I64d\n",ans);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |