| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1299225 | scalifrastico_098 | Game (IOI14_game) | C++20 | 1 ms | 340 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int y=1500;
int ik, k=0, rt[y];
void initialize(int n) {
for(int i=0; i<n; i++)rt[i]=i;
ik=n;
}
int hasEdge(int u, int v) {
if(rt[max(u, v)]){rt[max(u, v)]--; return 0;} return 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... | ||||
