| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343709 | ElyesChaabouni | Connecting Supertrees (IOI20_supertrees) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> p){
int n=p[0].size();
vector<vector<int>> ans(n,vector<int>());
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j==i+1||j==i-1)ans[i].push_back(1);
else ans[i].push_back(0);
}
}
build(ans);
return 1;
}