# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362699 | sean617 | Connecting Supertrees (IOI20_supertrees) | C++17 | 1 ms | 364 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>
#define N 1005
using namespace std;
int n, bu[N];
bool v[N], co[N][N];
vector<int> gu[N], cy, cy2, ans;
vector<std::vector<int> > answer;
int f(int p) {
if (bu[p] == p) return p;
else return bu[p] = f(bu[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, t, t1, t2, la;
n = p.size();
for (i = 0; i < n; i++) bu[i] = i;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (p[i][j]== 0) continue;
if (p[i][j] == 3) return 0;
t1 = f(i);
t2 = f(j);
if (t1 != t2) bu[t1] = t2;
}
}
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... |