Submission #380628

#TimeUsernameProblemLanguageResultExecution timeMemory
380628sumit_kk10게임 (IOI14_game)C++14
0 / 100
1 ms384 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 1500;
int cnt[N], ct[N], nn;

void initialize(int n){
	nn = n;
	for(int i = 0; i <= n; ++i){
		cnt[i] = 0;
		ct[i] = 0;
	}
}

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