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 <vector>
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector<vector<int>> answer(n, vector<int>(n));
vector<int> vals;
for (int i = 0; i<n; i++) {
bool isZero = p[i][0]==0;
for (int j = 0; j<n; j++) {
if ((p[i][j] == 0) != isZero) return 0;
}
if (!isZero) vals.push_back(i);
}
for (int i = 0; i<(int)(vals.size())-1; i++) {
answer[i][i+1] = 1;
answer[i+1][i] = 1;
}
build(answer);
return 1;
}
# | 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... |