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;
#define ar array
#define sz(v) int(v.size())
int n;
int construct(vector<vector<int>> g) {
n = sz(g);
vector<vector<int>> ans(n, vector<int>(n));
bool done=0;
[&](){
for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 1) return;
for (int i = 1; i < n; i++) ans[i][0] = ans[0][i] = 1;
build(ans), done=1;
}();
return done;
}
# | 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... |