# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309420 | jam_xd_ | 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 "bits/stdc++.h"
using namespace std;
int construct (int [][] p){
deque<vector<int> >resp;
for(int i=0;i<p.size();i++){
deque<int>jaja;
for(int j=0;j<p.size();j++){
if(i == 0 and j != 0) jaja.push_back(1);
else if(i != 0 and j == 0) jaja.push_back(1);
else if(i == 0 and j == 0)jaja.push_back(0);
}
resp.push_back(row);
}
build(resp);
return 1;
}