# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
817783 | OrazB | 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>
#include "supertrees.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
const int N = 1e5+5;
int tp[N];
int construct(vector<vector<int>> p){
vector<vector<int>> b(n, vector<int>(n));
int n = p.size();
for (int i = 0; i < n; i++){
if (tp[i]){
if (p[tp[i]] != p[i]) return 0;
continue;
}
for (int j = 0; j < n; j++){
if (p[i][j]){
tp[j] = i;
b[i][j] = b[j][i] = 1;
}
}
}
build(b);
return 1;
}