# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
888217 | 12345678 | Connecting Supertrees (IOI20_supertrees) | C++17 | 159 ms | 22352 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;
const int nx=1e3+5;
bool vs[nx];
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
for (int i=0; i<n; i++) for (int j=0; j<n; j++) if (p[i][j]==3) return 0;
vector<vector<int>> answer(n, vector<int> (n, 0));
vector<int> h;
for (int i=0; i<n; i++)
{
if (vs[i]) continue;
vector<int> d;
for (int j=0; j<n; j++) if (p[i][j]==1) vs[j]=1, d.push_back(j);
h.push_back(i);
int sz=d.size();
for (int j=0; j<sz-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
}
for (int i=0; i<n; i++) vs[i]=0;
for (int i=0; i<h.size(); i++)
{
if (vs[i]) continue;
vector<int> d;
for (auto j:h) if (p[i][j]) d.push_back(j), vs[j]=1;
if (d.size()==1) continue;
int sz=d.size();
for (int j=0; j<sz-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
answer[d[0]][d[sz-1]]=answer[d[sz-1]][d[0]]=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... |