Submission #129604

#TimeUsernameProblemLanguageResultExecution timeMemory
129604SortingGame (IOI14_game)C++14
0 / 100
2 ms504 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 1507;

int n, cnt[N], t = 1;

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

int hasEdge(int u, int v){
	cnt[u]++;
	cnt[v]++;

	if(cnt[u] >= t || cnt[v] >= t){
		cnt[u] = cnt[v] = -n;
		t++;

		return 1;
	}

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...