Submission #384884

#	Time	Username	Problem	Language	Result	Execution time	Memory
384884		Drew_	Game (IOI14_game)	C++14	0 / 100	1 ms	364 KiB

game

#include "game.h"
#include <assert.h>
#include <iostream>
using namespace std;

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]++;

	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;
}

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