# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156148 | mdn2002 | Topovi (COCI15_topovi) | C++14 | 6 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<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
int n,k,p,xr[105][105],pw[105][105],ans;
int main()
{
cin>>n>>k>>p;
for(int i=0;i<k;i++)
{
int x,y,z;
cin>>x>>y>>z;
x--,y--;
pw[x][y]=z;
for(int j=0;j<n;j++)
{
if(j==x)continue;
xr[j][y]^=z;
}
for(int j=0;j<n;j++)
{
if(j==y)continue;
xr[x][j]^=z;
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(xr[i][j]!=0)ans++;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |