Submission #381653

#	Time	Username	Problem	Language	Result	Execution time	Memory
381653		ritul_kr_singh	Game (IOI14_game)	C++17	100 / 100	520 ms	15980 KiB

game

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

int asked[1501][1501];
vector<int> e;
int n;
int find(int u){
	return e[u] < 0 ? u : e[u] = find(e[u]);
}
int sz(int u){
	return -e[find(u)];
}
void unite(int u, int v){
	u = find(u), v = find(v);
	if(u==v) return;
	if(e[u] > e[v]) swap(u, v);
	for(int i=1; i<=n; ++i){
		asked[u][i] += asked[v][i];
		asked[i][u] += asked[i][v];
	}
	e[u] += e[v], e[v] = u;
}


void initialize(int N){
	n = N;
	e.assign(n+1, -1);
	for(int i=0; i<=n; ++i)
		for(int j=0; j<=n; ++j)
			asked[i][j] = 0;
}

int hasEdge(int u, int v){
	++u, ++v;
	u = find(u), v = find(v);
	if(u==v) return 1;
	++asked[u][v];
	++asked[v][u];
	if(asked[u][v]==sz(u)*sz(v)){
		unite(u, v);
		return 1;
	}
	return 0;
}

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