제출 #211147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
211147		mode149256	게임 (IOI14_game)	C++14	100 / 100	533 ms	25976 KiB

game

/*input

*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#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 p;
int N;

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

void unionSet(int a, int b) {
	int prad = a;
	for (int i = 0; i < N; ++i)
	{
		if (p[i] == prad) {
			p[i] = b;
		}
	}
}

void merge(int a, int b) {
	unionSet(a, b);
	int tev = p[a];

	for (int i = 0; i < N; ++i)
	{
		if (i == a or i == b) continue;
		liko[i][tev] = liko[tev][i] = liko[a][i] + liko[b][i];
	}
}

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

	if (u == v) return 0;
	liko[u][v]--;
	liko[v][u]--;

	if (liko[u][v]) {
		return 0;
	}

	merge(u, v);
	return 1;
}

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