Submission #420432

#TimeUsernameProblemLanguageResultExecution timeMemory
420432victoriadTopovi (COCI15_topovi)C++14
30 / 120
45 ms65540 KiB
#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
 
using namespace std;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	int k,n,p,r,c,x,y;
	cin>>n>>k>>p;
	vector<vector<int> >t(n);
	vector<int>a(n,0);
	for(int i=0;i<n;i++)t[i]=a;
	vector<int>co(n,0);
	vector<int>ro(n,0);
	for(int i=0;i<k;i++){
		cin>>r>>c>>x;
		r--;
		c--;
		t[r][c]=x;
		co[c]^=x;
		ro[r]^=x;
	}
	while(p--){
		cin>>r>>c>>x>>y;
		r--;
		x--;
		c--;
		y--;
		int h=t[r][c];
		t[r][c]=0;
		t[x][y]=h;
		co[c]^=h;
		ro[r]^=h;
		co[y]^=h;
		ro[x]^=h;
		int con=0;
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if((co[i]^ro[j])>0)con++;
			}
		}
		cout<<con<<"\n";
	}
 
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...