Submission #382589

#	Time	Username	Problem	Language	Result	Execution time	Memory
382589		BlancaHM	Topovi (COCI15_topovi)	C++14	120 / 120	1085 ms	36928 KiB

topovi

#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long int ll;

int N, K, P;
long long int attacked;
map<pair<int, int>, int> rooks;
map<int, int> valRows, valCols, rowXOR, colXOR;

void init() {
	attacked = 0;
	valRows[0] = N;
	valCols[0] = N;
}

void include(int r, int c, int p) {
	attacked -= (ll) (N - valRows[colXOR[c]]);
	attacked -= (ll) (N - valCols[rowXOR[r]]);
	valRows[rowXOR[r]]--;
	valCols[colXOR[c]]--;
	rooks[{r, c}] = p;
	rowXOR[r] ^= p;
	colXOR[c] ^= p;
	valRows[rowXOR[r]]++;
	valCols[colXOR[c]]++;
	attacked += (ll) (N - valRows[colXOR[c]]);
	attacked += (ll) (N - valCols[rowXOR[r]]);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	int r, c, p, r2, c2;
	cin >> N >> K >> P;
	init();
	for (int i = 0; i < K; i++) {
		cin >> r >> c >> p;
		include(r-1, c-1, p);
		//cout << attacked << '\n';
	}
	for (int i = 0; i < P; i++) {
		cin >> r >> c >> r2 >> c2;
		p = rooks[{r-1, c-1}];
		include(r-1, c-1, p);
		include(r2-1, c2-1, p);
		cout << attacked << '\n';
	}
	return 0;
}

• Subtask 1: 120 / 120