# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62398 | evpipis | Game (IOI14_game) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
}