# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015992 | deera | Connecting Supertrees (IOI20_supertrees) | C++14 | 140 ms | 27984 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 <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
int construct(vector<vector<int>> p) {
int n = p.size();
vector<int> dist = {0, 0, 0, 0};
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
dist[p[i][j]]++;
// subtask 1
// p[i][j] ==0
// just a line
if (dist[1] == n*n) {
vector<vector<int>> r(n, vector<int>(n));
for(int i=0;i<n-1;i++) {
r[i][(i+1)%n] = 1;
r[(i+1)%n][i] = 1;
}
build(r);
return 1;
}
// substask 2
// p[i][j] == 0 or 1
// set of disconnected lines
if(dist[2] == 0 && dist[3] == 0) {
set<vector<int>> lines;
for(int i=0;i<n-1;i++) {
lines.insert(p[i]);
}
vector<vector<int>> r(n, vector<int>(n));
vector<int> dupes(n);
for (auto line: lines) {
vector<int> points;
for(int i=0;i<n;i++)
if (line[i] == 1)
points.push_back(i), dupes[i]++;
for(int i=1;i<points.size();i++) {
int a = points[i-1], b=points[i];
r[a][b] = 1;
r[b][a] = 1;
}
}
for(auto i: dupes)
if (i > 1) return 0;
build(r);
return 1;
}
return 0;
}
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... |