| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1029950 | codexistent | Game (IOI14_game) | C++14 | 1 ms | 600 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 <bits/stdc++.h>
using namespace std;
#define MAXN 1505
#define FOR(i, a, b) for(int i = a; i <= b; i++)
int N, ec[MAXN];
void initialize(int n){
N = n;
FOR(i, 1, N) ec[i] = 0;
}
int hasEdge(int u, int v){
ec[u]++, ec[v]++;
if(ec[u] == N - 1 || ec[v] == N - 1) {
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... | ||||
