| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 568367 | losmi247 | Game (IOI14_game) | C++14 | 328 ms | 16328 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;
typedef long long ll;
const int N = 1502;
int n;
int cnt = 0,kolko[N];
void initialize(int br){
n = br;
cnt = 0;
for(int i = 0; i <= n; i++) kolko[i] = 0;
}
int hasEdge(int u,int v){
u++;
v++;
cnt++;
if(u < v) swap(u,v);
kolko[u]++;
return kolko[u] == u-1;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
