Submission #210698

#TimeUsernameProblemLanguageResultExecution timeMemory
210698peuchGame (IOI14_game)C++17
0 / 100
5 ms256 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1600; int ingrau[MAXN]; int N, t; void initialize(int n) { N = n; for(int i = 0; i < n; i++){ for(int j = i + 1; j < n; j++){ ingrau[i]++; ingrau[j]++; } } } int hasEdge(int u, int v){ //printf("\t%d\n", ponte[u][v]); if(ingrau[u] <= 2 || ingrau[v] <= 2) return 1; else{ ingrau[u]--; ingrau[v]--; return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...