# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447431 | Nodir_Bobiev | Connecting Supertrees (IOI20_supertrees) | C++17 | 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 "supertrees.h"
#include <bits/stdc++.h>
using namespace std ;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector <vector <int>> ans;
for(int i = 0; i < n; i ++){
vector <int> row;
row.resize(n);
ans.push_back(row);
}
map <int, bool> us;
for(int i = 0; i < n; i ++){
if( us[i] || i == j ) continue;
for(int j = 0; j < n; j ++){
if( p[i][j] ){
if( us[j] ) return 0;
us[j] = 1;
ans[i][j] = ans[j][i] = 1;
}
}
}
build(ans);
return 1;
}