Submission #153702

#TimeUsernameProblemLanguageResultExecution timeMemory
153702dennisstarGame (IOI14_game)C++11
100 / 100
514 ms25548 KiB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int clr[1550];
int chk[1550][1550];

int fcnt, ucnt, n;

void Union(int a, int b) {
	ucnt--;
	for (int i=0; i<n; i++) {if (clr[i]==b) clr[i]=a;}
	for (int i=0; i<n; i++) chk[a][i]+=chk[b][i];
	for (int i=0; i<n; i++) chk[i][a]+=chk[i][b];
}

void initialize(int n_) {
	n=n_;
	ucnt=n; fcnt=0;
	for (int i=0; i<n; i++) {clr[i]=i;}
	for (int i=0; i<n; i++) for (int j=0; j<n; j++) if (i!=j) chk[i][j]=1;
}

int hasEdge(int u, int v) {
	fcnt++;
	if (ucnt==2) return 0;
	u=clr[u]; v=clr[v];
	if (u==v) {
		return 1;
	}
	if (chk[u][v]==1) {
		Union(u, v);
		return 1;
	} 
	else {
		chk[u][v]--; chk[v][u]--;
		return 0;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...