# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447396 | 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<std::vector<int>> answer;
for (int i = 0; i < n ; i++ ) {
vector<int> row;
row.resize(n);
for(int j = 0; j < n; j ++){
if( i == 1 ){
if( j != 1 ) row[j] = 1;
}
else{
if( j == 1 ) row[j] = 1;
}
}
answer.push_back(row);
}
build(answer);
return 1;
/*#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( n, vector <int> (n) );
map <int, bool> us;
for (int i = 0; i < n ; i++ ) {
if( us[i] ) continue;
ans[i][0] = 1;
for(int j = 0; j < n; j ++){
if( i != j && p[i][j] ){
ans[i][0] = 0, ans[i][j] = ans[j][i] = us[j] = 1;
for(int k = j + 1; k < n; k ++){
if( p[i][k] ){
ans[j][k] = ans[k][j] = us[k] = 1;
}
}
break;
}
}
}
build(ans);
return 1;
}*/
/*20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1*/