# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
380627 | sumit_kk10 | Game (IOI14_game) | C++14 | 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 <bits/stdc++.h>
using namespace std;
const int N = 1505;
int cnt[N], ct[N];
void initialize(int n){
for(int i = 0; i <= n; ++i){
cnt[i] = 0;
ct[i] = 0;
}
}
int hasEdge(int u, int v){
cnt[u]++;
cnt[v]++;
if(cnt[u] == (n - ct[u] - 1)){
cnt[u] = 0;
cnt[v] = 0;
ct[u]++, ct[v]++;
return 1;
}
if(cnt[v] == (n - ct[v] - 1)){
cnt[v] = 0;
cnt[u] = 0;
ct[u]++, ct[v]++;
return 1;
}
return 0;
}