| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 396747 | priority_queue | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 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.
// ioi 2020, day 1, supertrees
#include <bits/stdc++.h>
using namespace std;
#define forint(i, N) for (int i = 0; i < (N); i++)
using namespace std;
void build(std::vector<std::vector<int> > b) {
for (auto& a : b) {
for (auto& aa : a) {
cout << aa << " ";
}
cout << endl;
}
}
int construct(vector<std::vector<int> > p) {
int N = p.size();
vector< vector<int> > b(N, vector<int>(N, 0));
vector<int> visited(N, -1);
forint(i, N) {
if (visited[i] < 0) { // create new. All connected to i also not visited
//visited[i] = i;
vector<int> path2;
vector<int> path3;
forint (j, N) {
if (j == i) {
continue;
}
if (p[i][j] == 1) {
b[i][j] = 1;
b[j][i] = 1;
visited[j] = i;
continue;
}
if (p[i][j] == 2) {
if (!path3.empty()) {
return 0;
}
path2.push_back(j);
visited[j] = i;
continue;
}
if (p[i][j] == 3) {
if (!path2.empty()) {
return 0;
}
path3.push_back(j);
visited[j] = i;
continue;
}
}
if (!path2.empty()) {
if (path2.size() < 2) {
return 0;
}
b[i][path2[0]] = 1;
b[path2[0]][i] = 1;
forint(j, path2.size()-1) {
b[path2[j]][path2[j+1]] = 1;
b[path2[j+1]][path2[j]] = 1;
}
b[i][path2[path2.size()-1]] = 1;
b[path2[path2.size()-1]][i] = 1;
}
if (!path3.empty()) {
if (path3.size() < 3) {
return 0;
}
b[i][path3[1]] = 1;
b[path3[1]][i] = 1;
for(int j = 1; j < path3.size()-1; j++) {
b[path3[j]][path3[j+1]] = 1;
b[path3[j+1]][path3[j]] = 1;
}
b[i][path3[path3.size()-1]] = 1;
b[path3[path3.size()-1]][i] = 1;
b[i][path3[0]] = 1;
b[path3[0]][i] = 1;
b[path3[0]][path3[1]] = 1;
b[path3[1]][path3[0]] = 1;
}
}
else { // check if it is OK
forint (j, N) {
if (j != i && j != visited[i]) {
if (p[i][j] == p[visited[i]][j] && p[i][j] == p[visited[i]][i]) {
continue;
}
if (p[i][j] == p[visited[i]][j] * p[visited[i]][i]) {
continue;
}
//cout << i << " ---- " << j << endl;
return 0;
}
}
}
}
build(b);
return 1;
}