Submission #109808

#	Time	Username	Problem	Language	Result	Execution time	Memory
109808		arman_ferdous	Game (IOI14_game)	C++17	0 / 100	3 ms	428 KiB

game

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

const int N = 1510;
int p[N], cnt[N];

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

int find(int u) {
	if(p[u] == u) return u;
	return p[u] = find(p[u]);
}

int hasEdge(int u, int v) {
	cnt[u]--;
	cnt[v]--;
    if(find(u) == find(v)) {
    	if(cnt[u] == 0 || cnt[v] == 0) return 1;
    	return 0;
    }
    if(cnt[u] == 0 || cnt[v] == 0) {
    	p[find(u)] = find(v);
    	return 1;
    } return 0;
}

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