Submission #379854

#TimeUsernameProblemLanguageResultExecution timeMemory
379854MounirGame (IOI14_game)C++14
100 / 100
434 ms16620 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int N = 2000; int nFaits[N], nNoeuds; void initialize(int n) { nNoeuds = n; for (int noeud = 0; noeud < nNoeuds; ++noeud) nFaits[noeud] = 0; } int hasEdge(int u, int v) { u = max(u, v); nFaits[u]++; if (nFaits[u] == u) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...