Submission #29805

#TimeUsernameProblemLanguageResultExecution timeMemory
29805nibnalinGame (IOI14_game)C++14
0 / 100
0 ms10812 KiB
#include <iostream>
#include <cstdio>
#include <vector>
#include "game.h"
using namespace std;

const int maxn = 1505;

int n, nope[maxn];

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

int hasEdge(int u, int v)
{
	if(nope[u] == n-2 || nope[v] == n-2) return 1;
	else
	{
		nope[u]++, nope[v]++;
		//cout << n << " " << nope[u] << " " << nope[v] << "\n";
		return 0;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...