| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 394315 | snasibov05 | Connecting Supertrees (IOI20_supertrees) | C++14 | 1094 ms | 14396 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>
using namespace std;
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> answer(n, vector<int>(n));
vector<int> cmp_n(n, -1);
vector<vector<int>> cmp;
int k = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (p[i][j] == 1){
cmp_n[i] = cmp_n[j];
cmp[cmp_n[i]].push_back(i);
}
}
if (cmp_n[i] == -1) cmp_n[i] = k++, cmp.push_back({i});
}
for (int i = 0; i < cmp.size(); ++i) {
for (int j = 0; j < cmp[i].size(); ++j) {
for (int l = 0; l < cmp[i].size(); ++l) {
if (p[cmp[i][j]][cmp[i][l]] == 0) return 0;
if (j == 0 && l != 0) answer[cmp[i][j]][cmp[i][l]] = answer[cmp[i][l]][cmp[i][j]] = 1;
}
}
}
build(answer);
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... | ||||
