# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433576 | sean617 | Connecting Supertrees (IOI20_supertrees) | C++17 | 273 ms | 25160 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 "supertrees.h"
#include <vector>
#include <cstring>
#define N 1005
using namespace std;
int n, cnt, bu[N], bu2[N], gut[N];
bool v[N], co[N][N], icy[N];
vector<int> gu[N], cy[N], cy2, ans, ch[N];
vector<std::vector<int> > answer;
int f(int p) {
if (bu[p] == p) return p;
else return bu[p] = f(bu[p]);
}
int f2(int p) {
if (bu2[p] == p) return p;
else return bu2[p] = f2(bu2[p]);
}
void f_co(int p, int q) {
co[p][q] = co[q][p] = 1;
}
int construct(std::vector<std::vector<int> > p) {
int i, j, k, t, t1, t2, la, tcnt;
n = p.size();
for (i = 0; i < n; i++) {bu[i] = i; bu2[i] = i;}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |