This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
public class supertrees {
int construct(int[][] p) {
int n = p.length;
if (areAllOnes(p)) {
return constructForAllOnes(n);
}
int[][] answer = new int[n][n];
grader.build(answer);
return 1;
}
boolean areAllOnes(int[][] p) {
for (int i = 0; i < p.length; i++) {
for (int j = 0; j < p[i].length; j++) {
if (p[i][j] != 1) return false;
}
}
return true;
}
int constructForAllOnes(int n) {
int[][] res = new int[n][n];
for (int i = 0; i < n - 1; i++) {
res[i][i + 1] = 1;
res[i + 1][i] = 1;
}
grader.build(res);
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... |