# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696264 | T0p_ | 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.
// Subtask 2
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
bool visited[N];
int fp(int u) { return pa[u] = (u == pa[u]) ? u : fp(pa[u]); }
int construct(vector<vector<int>> p)
{
int n = p.size();
vector<vector<int>> ans(n, vector<int> (n, 0));
for (int i=0 ; i<n ; i++)
{
if (visited[i]) continue ;
visited[i] = true;
for (int j=0 ; j<i ; j++) if (p[i][j] == 1) return 0;
for (int j=i, k=i+1 ; k<n ; k++) if (p[i][k] == 1)
{
if (visited[k]) return 0;
visited[k] = true;
ans[j][k] = ans[j][k] = 1;
j = k;
}
}
build(ans);
return 1;
}