# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
771122 | OrazB | Connecting Supertrees (IOI20_supertrees) | C++17 | 185 ms | 28432 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 N 100005
#define pb push_back
vector<int> vec[N];
int construct(vector<vector<int>> p){
int n = p.size();
vector<vector<int>> b(n, vector<int>(n, 0));
vector<int> vis(n, 0), ok(n, 0);
int cnt = 0;
for (int i = 0; i < n; i++){
if (vis[i]){
if (p[i] != vec[vis[i]]) return 0;
continue;
}
cnt++;
for (int j = 0; j < n; j++){
if (p[i][j] and i != j){
if (p[i][j] == 1){
b[i][j] = b[j][i] = 1;
vis[j] = cnt;
}
}
vec[cnt].pb(p[i][j]);
}
}
for (int i = 0; i < n; i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |