# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1083959 | nickolasarapidis | 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(vector<vector<int>> p){
int N = p.size();
vector<vector<int>> b(N, vector<int>(N, 0));
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(satisfied[i][j]) continue;
for(int k = 0; k < N; k++){
if(j == k) continue;
if(b[j][k] == 1) continue;
if(p[j][k] == p[i][k]){
b[i][k] = 1;
}
}
}
}
build(b);
return 1;
}