Submission #210694

#TimeUsernameProblemLanguageResultExecution timeMemory
210694peuchGame (IOI14_game)C++17
0 / 100
5 ms376 KiB
#include "game.h"
#include <cstdio>

const int MAXN = 1600;

bool ar[MAXN][MAXN];
int ingrau[MAXN];

void initialize(int n) {
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			ar[i][j] = 1;
			ingrau[i]++;
			ingrau[j]++;
		}
	}
}

int hasEdge(int u, int v) {
	if(ingrau[u] > 1 && ingrau[v] > 1){
		ingrau[u]--;
		ingrau[v]--;
		// printf("%d %d\n", ingrau[u], ingrau[v]);
		return 0;
	}
    return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...