Submission #488712

#	Time	Username	Problem	Language	Result	Execution time	Memory
488712		Drew_	Game (IOI14_game)	C++17	15 / 100	1 ms	332 KiB

game

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

#define ii pair<int, int>

constexpr int MAX = 1507;

int node, ctr, edge;
int fq[MAX] = {};
map<ii, bool> memo;

void initialize(int n) {
	node = n; ctr = edge = 0;
	memo.clear();
	for (int i = 1; i <= n; ++i)
		fq[i] = 0;
}


int hasEdge(int u, int v) {
	if (u > v)
		swap(u, v);
	assert(!memo.count({u, v}));
	memo[{u, v}] = true;

	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: 15 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58