제출 #384898

#제출 시각아이디문제언어결과실행 시간메모리
384898Drew_게임 (IOI14_game)C++14
15 / 100
2 ms492 KiB
#include "game.h"
#include <assert.h>
const int MAX = 1507;

int node = 0;
int ctr = 0;
int edge = 0;
int fq[MAX] = {};

void initialize(int n) {
	node = n;
}

int hasEdge(int u, int v) {
	ctr++;
	fq[u]++, fq[v]++;

	assert(ctr <= 525);

	if (fq[u] == node-1 || fq[v] == node-1)
	{
		edge++;
		return 1;
	}

	if (ctr-1 + node - 1 - edge == node * (node - 1) / 2)
	{
		edge++;
		return 1;
	}

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...