# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783592 | pravcoder | Connecting Supertrees (IOI20_supertrees) | C++14 | 172 ms | 23928 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;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> v2i;
int construct(v2i p) {
int n = p.size();
v2i answer;
for (int i = 0; i < n; i++) {
vi row;
row.resize(n);
answer.push_back(row);
}
//sub 2
vi part(n);
v2i parts;
int next = 0;
int nextpart;
vb visited(n);
int v = 0;
int pnum = 0;
part[0] = 1;
while (v < n) {
int current = next;
for (int i = 0; i < n; i++)
{
if (p[current][i]) {
if (part[i] == -1) return 0;
if (!visited[i]){
part[i] = 1;
next = i;
}
} else {
if (part[i] == 1) return 0;
if (!visited[i]){
part[i] = -1;
nextpart = i;
}
}
}
visited[current] = 1;
v++;
if (next == current) {
next = nextpart;
parts.push_back({});
for (int i = 0; i < n; i++)
{
if (part[i] == 1) parts[pnum].push_back(i);
}
pnum++;
part.clear();
part.resize(n);
part[next] = 1;
}
}
for (auto part : parts)
{
for (int i = 0; i < part.size() - 1; i++)
{
answer[part[i]][part[i + 1]] = 1;
answer[part[i + 1]][part[i]] = 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... |