| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 72429 | nvmdava | Game (IOI14_game) | C++17 | 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;
int a[1501];
int n;
void initialize(int n)
{
::n = n;
for(int i = 0; i < n; i++){
a[i] = n;
}
}
int hasEdge(int u, int v)
{
if(a[u] == 1 || a[v] == 1){
a[u] = 0;
a[b] = 0;
return 1;
}
a[u]--;
a[v]--;
return 0;
}