| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1299237 | alexiah | Game (IOI14_game) | C++20 | 1 ms | 340 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
set<ll> all , used;
void initialize(int n) {
for(ll i = 0; i < n; i++) all.insert(i);
}
int hasEdge(int u, int v) {
used.insert(u); used.insert(v);
if(all.size() > 1 && (used.find(u) != used.end() || used.find(v) != used.end())){
all.erase(u); all.erase(v);
return 1;
}
else 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... | ||||
