# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383295 | Iwanttobreakfree | Topovi (COCI15_topovi) | C++17 | 2 ms | 508 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 <iostream>
#include <vector>
using namespace std;
int main(){
int n,k,p,r,c,x,a,b,a2,b2;
cin>>n>>k>>p;
int grid[n][n];
vector<int> colum(n,0);
vector<int> fil(n,0);
while(k--){
cin>>r>>c>>x;
r--;c--;
grid[r][c]=x;
colum[r]^=x;
fil[c]^=x;
}
int cont=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(colum[i]!=fil[j])cont++;
}
}
//cout<<cont<<' ';
while(p--){
cont=0;
cin>>a>>b>>a2>>b2;
a--;b--;a2--;b2--;
x=grid[a][b];
grid[a][b]=0;
grid[a2][b2]=x;
fil[b]^=x;
colum[a]^=x;
fil[b2]^=x;
colum[a2]^=x;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(colum[i]!=fil[j])cont++;
}
}
cout<<cont<<'\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |