# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421178 | Apiram | 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>
using namespace std;
int construct(vector<std::vector<int>> p) {
int n = p.size();
for (int i =0;i<n;++i){
p[i][i]=0;
}
vector<vector<int>>answer(n,vector<int>(n,0));
for (int i =0;i<n;++i){
for (int j =0;j<n;++j){
if (p[i][j]>0){
answer[i][j]=1;
p[i][j]--;
}
}
}
for (int i =0;i<n;++i){
for (int j =0;j<n;++j)cout<<answer[i][j]<<" ";
cout<<endl;
}
build(answer);
return 1;
}