| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 303853 | dolphingarlic | Connecting Supertrees (IOI20_supertrees) | C++14 | 257 ms | 26108 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 <bits/stdc++.h>
using namespace std;
int cmp[1000];
vector<pair<int, int>> has[4];
vector<int> cn[1000];
int find(int A) {
while (A != cmp[A]) A = cmp[A], cmp[A] = cmp[cmp[A]];
return A;
}
void onion(int A, int B) { cmp[find(A)] = find(B); }
int construct(vector<vector<int>> p) {
int n = p.size();
for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) {
has[p[i][j]].push_back({i, j});
}
vector<vector<int>> ans(n, vector<int>(n, 0));
iota(cmp, cmp + n, 0);
for (pair<int, int> i : has[1]) onion(i.first, i.second);
for (int i = 0; i < n; i++) cn[find(i)].push_back(i);
for (int i = 0; i < n; i++) {
if (!cn[i].size()) continue;
for (int j = 1; j < cn[i].size(); j++)
ans[cn[i][j]][cn[i][0]] = ans[cn[i][0]][cn[i][j]] = 1;
cn[i].clear();
}
for (pair<int, int> i : has[0]) if (find(i.first) == find(i.second)) return 0;
build(ans);
return 1;
}
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... | ||||
