Submission #164106

#	Time	Username	Problem	Language	Result	Execution time	Memory
164106		beso123	Topovi (COCI15_topovi)	C++14	120 / 120	1630 ms	35252 KiB

topovi

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ll long long
using namespace std;
map<int,int> xorr,xorc,cntr,cntc;
map<pair<int,int>,int> rook;
ll 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--;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k>>p;
    cntr[0]=n;
    cntc[0]=n;
    rep(i,k){
    	int r,c,x;
    	cin >> r >> c >> x;
    	add(r,c,x);
    }
    while(p--){
    	int r1,c1,r2,c2;
    	cin>>r1>>c1>>r2>>c2;
        int x=rook[{r1,c1}];
    	add(r1,c1,x);
        add(r2,c2,x);
    	cout<<ans<<'\n';
    }
    return 0;
}

• Subtask 1: 120 / 120