Submission #442861

#TimeUsernameProblemLanguageResultExecution timeMemory
442861ivandasfsGame (IOI14_game)C++14
100 / 100
353 ms16388 KiB
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include "game.h"

using namespace std;

#define mp make_pair
#define pb push_back
#define x first
#define y second

typedef long long ll;

const ll INF = 1e9+5;
const ll MOD = 1e9+7;

int cnt[1505];
int N;

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

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