# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301786 | Pro100Yan | Connecting Supertrees (IOI20_supertrees) | C++14 | 271 ms | 22136 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>
#include <iostream>
#define ll long long
#define pb push_back
using namespace std;
const int N = 20005;
vector<vector<int>> ans;
int d[N];
int get_parent(int v){
if(v == d[v])
return v;
return d[v] = get_parent(d[v]);
}
void add(int u, int v){
int f = get_parent(u), s = get_parent(v);
if(f != s)
d[f] = d[s];
}
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
int fault = 0;
for(int i = 0; i < n; i++)
d[i] = i;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
ans.push_back(row);
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(p[i][j]){
add(i, j);
}
}
}
int pi, pj;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
pi = get_parent(i);
pj = get_parent(j);
if(p[i][j]){
if(pi != pj)
return 0;
if(pi != i)
ans[i][pi] = ans[pi][i] = 1;
if(pi != j)
ans[j][pi] = ans[pi][j] = 1;
}
else{
if(pi == pj)
return 0;
}
}
}
build(ans);
return 1;
}
/*
5
1 0 0 1 1
0 1 1 0 0
0 1 1 0 0
1 0 0 1 1
1 0 0 1 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... |