| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367608 | elotelo966 | Connecting Supertrees (IOI20_supertrees) | C++20 | 0 ms | 0 KiB |
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
//#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n,0);
answer.push_back(row);
}
for(int i=0;i<n;i++){
if(i<n-1){
row[i][i+1]=1;
row[i+1][i]=1;
}
}
build(answer);
return 1;
}
