Submission #442965

#	Time	Username	Problem	Language	Result	Execution time	Memory
442965		asbsfds	Game (IOI14_game)	C++14	100 / 100	418 ms	15560 KiB

game

#include "game.h"
#include <bits/stdc++.h>
const int maxn = 2000;

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

int niz[maxn];
int hasEdge(int u, int v) {
    u = std::min(u, v);
    return ++niz[u] >= n - u - 1;
}

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