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;
void initialize(int n) {
}
int c[2000];
//genius one liner
//partition edges but the larger endpoint
//end result will be a tree but H is never disconnected
int hasEdge(int u, int v) {
return ++c[max(u,v)] == max(u,v);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |