| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 319393 | Nayna | Game (IOI14_game) | C++14 | 386 ms | 16484 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>
using namespace std;
const int mxn = 2000;
int cnt[mxn];
int node;
void initialize(int n) {
node = n;
for(int i = 0; i <= n; i++) cnt[i] = 0;
}
int hasEdge(int u, int v) {
if(u>v) swap(u, v);
u++, v++;
cnt[u]++;
//cout << u << ' ' << cnt[u] << '\n';
if(cnt[u]==(node-u)) return 1;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
