Submission #254187

#	Time	Username	Problem	Language	Result	Execution time	Memory
254187		b00n0rp	Game (IOI14_game)	C++17	100 / 100	515 ms	25336 KiB

game

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

int adj[1505][1505];
int par[1505];
int N;

void initialize(int n) {
	for(int i = 0; i < n; i ++){
		for(int j = 0; j < n; j ++){
			adj[i][j] = 1;
		}
		par[i] = i;
	}
	N = n;
}

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

void merge(int u,int v){
	for(int i = 0; i < N; i ++){
		adj[u][i] += adj[v][i];
		adj[i][u] = adj[u][i];
	}
	par[v] = u;
}

int hasEdge(int u, int v) {
	u = find(u);
	v = find(v);
    if(adj[u][v] == 1){
    	merge(u,v);
    	return 1;
    }
    adj[u][v]--;
    adj[v][u]--;
    return 0;
}

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