#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>
#define ll long long
#define ff first
#define ss second
using namespace std;
int construct(std::vector<std::vector<int> > p) {
int n = p.size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(row);
}
ll cuenta = 0;
int unos[n];
for(int i = 0 ; i <n ; i ++){
cuenta=0;
for(int j = 0 ; j < n ; i++){
if(i!=j && p[i][j]==1)cuenta++;
}
unos[i]=cuenta;
}
/// uno los que solo tienen un camino
vector<int>recorridos;
recorridos.resize(n);
int pp = 0;
for(int cur = 0 ; cur < n ; cur++){
if(!unos[cur])continue;
pp = 0;
for(int j = 0 ; j < n ; j ++){
if(cur!=j && p[cur][j]==1){
recorridos[pp]=j;
pp++;
}
}
for(int i = 0 ; i < pp ; i++){
//tengo que unir los de recorridos por una linea
}
}
build(answer);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1072 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1072 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1081 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1078 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1072 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1072 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |