| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1033248 | ender | Game (IOI14_game) | C++17 | 0 ms | 348 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 = 1502;
vector<int> cnt(N, 0);
int actn;
void initialize(int n) {
actn = n;
for(int i = 0; i < n; ++i){
cnt[i]++;
}
}
int hasEdge(int u, int v) {
if(cnt[u] == actn-1 || cnt[v] == actn-1){
cnt[u]++;
cnt[v]++;
return 1;
} else {
cnt[u]++;
cnt[v]++;
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... | ||||
