Submission #196985

#TimeUsernameProblemLanguageResultExecution timeMemory
196985JuneyGame (IOI14_game)C++14
0 / 100
11 ms9212 KiB
#include "game.h"
#include <cstring>
int A[1505], N;
int G[1505][1505];

void initialize(int n) {
	N = n;
	memset(G, -1, sizeof(G));
}

int hasEdge(int u, int v) {
	if(G[u][v] == -1) {
		A[u]++; A[v]++;
		if(A[u] >= N-1 || A[v] >= N-1) return G[u][v] = G[v][u] = 1;
		else return G[u][v] = G[v][u] = 0;
	}
	return G[u][v];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...