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(), cnt = 0;
vector<vector<int>> b(N, vector<int>(N, 0));
vector<vector<int>> curPaths(N, vector<int>(N, 0));
vector<vector<bool>> satisfied(N, vector<bool>(N, false));
vector<int> adj[N];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(i == j){
curPaths[i][j] = 1;
satisfied[i][j] = true;
cnt++;
}
if(p[i][j] == 0){
satisfied[i][j] = true;
cnt++;
}
}
}
if(cnt == N*N){
build(b);
return 1;
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(satisfied[i][j]) continue;
for(int k = 0; k < N; k++){
if(satisfied[i][k] = true) continue;
if(p[j][k] == p[i][k]){
b[i][k] = 1;
}
}
}
}
build(b);
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... |