# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119076 | adaawf | 슈퍼트리 잇기 (IOI20_supertrees) | C++17 | 2 ms | 592 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 <iostream>
#include <vector>
#include "supertrees.h"
using namespace std;
vector<int> v[1005];
int p[1005];
vector<vector<int>> res;
int Find(int x) {
if (x == p[x]) return x;
return p[x] = Find(p[x]);
}
void Merge(int x, int y) {
x = Find(x);
y = Find(y);
if (x == y) return;
if (v[x].size() < v[y].size()) {
swap(x, y);
}
for (int w : v[y]) v[x].push_back(w);
v[y].clear();
res[x][y] = res[y][x] = 1;
}
void build(vector<vector<int>> b);
int construct(vector<vector<int>> a) {
int n = a.size();
res = vector<vector<int>>(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
p[i] = i;
v[i].clear();
v[i].push_back(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1) {
Merge(i, j);
}
}
}
for (int i = 0; i < n; i++) {
if (Find(i) == i) {
for (int w : v[i]) {
for (int ww : v[i]) {
if (a[w][ww] != 1) return 0;
}
}
}
}
build(res);
}
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... |