# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62398 | 2018-07-28T10:39:45 Z | evpipis | Game (IOI14_game) | C++11 | 0 ms | 0 KB |
#include "game.h" #include <bits/stdc++.h> const int len = 1505; int cnt[len]; void initialize(int n){ for (int i = 0; i < n; i++) cnt[i] = i; } int hasEdge(int u, int v){ cnt[max(v, u)]--; return (cnt[max(v, u)] == 0); }