# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113316 | IVIosab | Topovi (COCI15_topovi) | C++17 | 1737 ms | 46080 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;
#define ll long long
#define f first
#define s second
ll n,k,p;
ll ans=0;
map<pair<int,int>,long long> mpr;
map<int,long long> rows,cols,cntrows,cntcols;
void update(int r,int c,int x){
ans-=(n-cntrows[cols[c]]);
ans-=(n-cntcols[rows[r]]);
if(rows[r]==cols[c]){
ans++;
}
cntrows[rows[r]]--;
rows[r]^=x;
cntrows[rows[r]]++;
cntcols[cols[c]]--;
cols[c]^=x;
cntcols[cols[c]]++;
ans+=(n-cntrows[cols[c]]);
ans+=(n-cntcols[rows[r]]);
if(rows[r]==cols[c]){
ans--;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |