# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079148 | 7mody | Connecting Supertrees (IOI20_supertrees) | C++17 | 1 ms | 348 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>> answer;
for (int i = 0; i < n; i++) {
vector<int> row;
row.resize(n);
answer.push_back(row);
}
vector<int> arr;
vector<bool> found(n);
for(int i = 0; i < n;i++){
if(p[i][i] != 1) return 0;
for(int j = 0; j < n;j++){
if(p[i][j] != p[j][i]) return 0;
if(p[i][j] == 2){
if(!found[i]){
arr.push_back(i);
found[i] = true;
} if(!found[j]){
arr.push_back(j);
found[j] = true;
}
}
}
}
if(arr.size()) arr.push_back(arr[0]);
for(int i = 0; i < arr.size() - 1;i++){
answer[arr[i]][arr[i+1]] = answer[arr[i+1]][arr[i]] = 1;
}
build(answer);
return 1;
}
Compilation message (stderr)
# | 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... |