| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 379854 | Mounir | Game (IOI14_game) | C++14 | 434 ms | 16620 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 N = 2000;
int nFaits[N], nNoeuds;
void initialize(int n) {
nNoeuds = n;
for (int noeud = 0; noeud < nNoeuds; ++noeud)
nFaits[noeud] = 0;
}
int hasEdge(int u, int v) {
u = max(u, v);
nFaits[u]++;
if (nFaits[u] == 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... | ||||
