# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379853 | 2021-03-19T14:11:48 Z | Mounir | Game (IOI14_game) | C++14 | 0 ms | 0 KB |
#include "game.h" #include <bits/stdc++.h> using namespace std; const int N = 2000; int nFaits[N]; 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; }