제출 #1143269

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143269		THXuan	Topovi (COCI15_topovi)	C++20	30 / 120	50 ms	328 KiB

topovi

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

int grid[105][105];

int calculate(int n)
{
	int counter = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			int row = 0;
			for (int k = 1; k <= n; k++) {
				if (k == i)continue;
				else row = row ^ grid[k][j];
			}
			int col = 0;
			for (int k = 1; k <= n; k++) {
				if (k == j) continue;
				else col = col ^ grid[i][k];
			}
			if ((row ^ col) > 0)++counter;
		}
	}
	return counter;
}
void solve()
{
	int n, k, p; cin >> n >> k >> p;
	for (int i = 1; i <= k; i++) {
		int r, c, x; cin >> r >> c >> x;
		grid[r][c] = x;
	}
	while (p--) {
		int r1, c1, r2, c2;
		cin >> r1 >> c1 >> r2 >> c2;
		grid[r2][c2] = grid[r1][c1];
		grid[r1][c1] = 0;
		int ans = calculate(n);
		cout << ans << "\n";
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1; //cin>>t;
	while (t--) solve();
	return 0;
}

• Subtask 1: 30 / 120