Submission #19020096

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <sstream>
#include <tuple>
#include <vector>

using namespace std;
using namespace chrono;

#ifdef DEBUG
	#define LOCAL_INPUT_FILE
#else
	//~ #define USE_FILE_IO
#endif

#ifdef USE_FILE_IO
	#define INPUT_FILE "input.txt"
	#define OUTPUT_FILE "output.txt"
	#define cin ____cin
	#define cout ____cout
	ifstream cin(INPUT_FILE);
	ofstream cout(OUTPUT_FILE);
#else
	#ifdef LOCAL_INPUT_FILE
		#define cin ____cin
		ifstream cin("input.txt");
	#endif
#endif

const int infinity = (int)1e9 + 42;
const int64_t llInfinity = (int64_t)1e18 + 256;
const int module = (int)1e9 + 7; 
const long double eps = 1e-8;

mt19937_64 randGen(system_clock().now().time_since_epoch().count());

inline void raiseError(string errorCode) {
	cerr << "Error : " << errorCode << endl;
	exit(42);
}

signed main() {
	#ifndef USE_FILE_IO
		ios_base::sync_with_stdio(false);
	#endif

	int n; cin >> n;
	map<int, int> pv;
	map<int, pair<int, int>> ph;
	for (int i = 0; i < n; ++i) {
		int x, y; cin >> x >> y;
		--x; --y;
		pv[y] ^= 1;
		if (y % 3 != 2) {
			ph[x].first ^= 1;
		}
		if (y % 3 != 0) {
			ph[x].second ^= 1;
		}
	}
	
	int ans = 0;
	int nv[3] = {0, 0, 0};
	for (auto [y, v] : pv) {
		if (!v) {
			continue;
		}
		++nv[y % 3];
		++ans;
	}
	//~ int cv[3] = {0, 0, 0};
	for (auto [x, xx] : ph) {
		auto [p1, p2] = xx;
		if (!p1 && !p2) {
			continue;
		}
		int val = p1 ? (p2 ? 1 : 0) : 2;
		//~ ++cv[val];
		int v1s[3] = {1, 2, 0};
		int v2s[3] = {2, 0, 1};
		int v1 = v1s[val], v2 = v2s[val];
		if (nv[val] == 0) {
			if (nv[v1] == 0 && nv[v2] == 0) {
				ans += 2;
			} else {
				--nv[v1];
				--nv[v2];
			}
		} else {
			--nv[val];
		}
	}
	
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result