#include "worldmap.h"
#include <vector>
const int MxN = 44;
std::vector<int> adj[MxN];
inline void cleanup() {
for(int i=0; i<MxN; ++i) {
adj[i].clear();
}
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
cleanup();
std::vector<std::vector<int>> world_map(N, std::vector<int> (N, 0));
for(int i=0; i<M; ++i) {
int u = A[i], v = B[i];
adj[u].emplace_back(v);
adj[v].emplace_back(u);
}
int cur = -1;
for(int i=0; i<N; ++i) {
if((int) adj[i].size() != 1) {
continue;
}
cur = i;
break;
}
int parent = -1;
for(int i=0; i<N; ++i) {
world_map[i] = std::vector<int> (N, cur);
for(auto v: adj[cur]) {
if(v == parent) {
continue;
}
parent = cur;
cur = v;
break;
}
}
return world_map;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |