Submission #879798

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

game

void initialize(int n);
int hasEdge(int u, int v);

const int N = 1001;

int n, mp[N], par[N];


int root(int x) {
	return x == par[x] ? x : par[x] = root(par[x]);
}
void merge(int u, int v) {
	u = root(u), v = root(v);
  	if (u == v) return;
  	par[v] = u;
}

void initialize(int cnt)
{
	n = cnt;
	for (int i = 1; i <= cnt; i++)
		mp[i] = 0;
	for (int i = 1; i <= cnt; i++)
		par[i] = i;
}

int hasEdge(int u, int v)
{
  	if (u > v) {
		int tmp = u;
		u = v;
		v = tmp;
	}
	if (root(u) == root(v))
		return 1;
	mp[u]++, mp[v]++;
  	if (mp[u] == n-1 || mp[v] == n-1) {
      		merge(u, v);
		mp[u] = 0;
		mp[v] = 0;
		return 1;
	}
	return 0;
}

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