# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977432 | Amaarsaa | 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.
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
vector < int > adj[1002];
int used[1002];
vector < int > v;
void Go(int x) {
used[x] = 1;
v.push_back(x);
for ( int X : adj[x]) {
if (!used[X]) {
Go(X);
}
}
}
int construct(vector< vector< int> > a) {
int n = a.size();
vector < vector < int > > ans;
ans.resize(n);
for (int i = 0; i < n; i++) {
ans[i].resize(n);
for (int j = 0; j < n; j ++) {
if ( a[i][j] != 0 && i != j) adj[i].push_back(j);
}
}
for (int i = 0; i < n; i ++) {
if ( used[i] == 0) {
v.clear();
Go(i);
for (int j = 1; j < v.size(); j ++) ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 1;
}
}
build(answer);
return 1;
}
/*
vector < vector < int > > b;
inp() {
int n, i, j, x;
cin >>n;
b.resize(n);
for (i = 0; i < n; i ++) {
for (j = 0; j < n; j ++) {
cin >> x;
b[i].push_back(x);
}
}
}
int main() {
inp();
cout << construct(b) << endl;
}
*/