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>
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> a;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
a.push_back(row);
}
for(int i = 0; i < n; i ++)
{
int oka = -1;
for(int j = 0; j < n; j ++)
{
if(p[i][j])
{
oka = j;
break;
}
}
if(~oka)
{
a[i][oka] = a[oka][i] = 1;
}
}
build(a);
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... |