| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 554978 | beaconmc | 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;
long long sussy[1500];
ll N = 0;
void initialize(int n){
for(int i=0; i<n; i++){
sussy[i] = 0;
}
N = n;
}
int hasEdge(int u, int v){
sussy[u] += 1;
sussy[v] += 1;
if (sussy[u] == N-1){
return 1;
}else if (sussy[v] == N-1){
return 1;
}
return 0;
}
