Submission #210866

#	Time	Username	Problem	Language	Result	Execution time	Memory
210866		mode149256	Game (IOI14_game)	C++14	42 / 100	1066 ms	14156 KiB

game

/*input

*/
#include <bits/stdc++.h>
#include "game.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

const int MX = 1510;

vii liko(MX, vi(MX, 1));
vbb buvo(MX, vb(MX, false));
vi rankas;
vi p;
int N;

int findSet(int i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); }
bool isSameSet(int i, int j) { return findSet(i) == findSet(j); }
void unionSet(int i, int j) {
	if (isSameSet(i, j)) return;

	int x = findSet(i), y = findSet(j);
	if (rankas[x] > rankas[y]) p[y] = x;
	else {
		p[x] = y;
		if (rankas[x] == rankas[y]) rankas[y]++;
	}
}

void initialize(int n) {
	N = n;
	p = vi(n + 1); for (int i = 0; i <= n; i++) p[i] = i;
	rankas = vi(n + 1, 0);
}

void merge(int a, int b) {
	unionSet(a, b);
	int tev = findSet(a);

	vi curr;
	vi kiti;

	for (int i = 0; i < N; ++i)
	{
		if (findSet(i) != tev) kiti.emplace_back(i);
		else curr.emplace_back(i);
		liko[tev][i] = 0;
		liko[i][tev] = 0;
	}

	for (auto pir : curr) {
		for (auto ant : kiti) {
			liko[tev][findSet(ant)] += !buvo[pir][ant];
			liko[findSet(ant)][tev] += !buvo[pir][ant];
		}
	}
}

int hasEdge(int u, int v) {
	buvo[u][v] = buvo[v][u] = true;
	u = findSet(u);
	v = findSet(v);

	if (u == v) return 0;

	if (liko[u][v] != 1) {
		liko[u][v]--;
		liko[v][u]--;
		return 0;
	}

	merge(u, v);
	return 1;
}

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 0 / 58