#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> gr[41];
vector<int> v;
void dfs(int x, int p)
{
v.push_back(x);
for (int i : gr[x])
{
if (i == p) continue;
dfs(i, x);
v.push_back(x);
}
}
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B)
{
for (int i = 0; i < 41; i++) gr[i].clear();
v.clear();
for (int i = 0; i < M; i++)
{
gr[A[i]].push_back(B[i]);
gr[B[i]].push_back(A[i]);
}
dfs(1, 0);
int K = v.size();
vector<vector<int>> ans(K, vector<int>(K));
for (int i = 0; i < K; i++) {
for (int j = 0; j < K; j++) {
ans[i][j] = v[i];
}
}
return ans;
}
| # | 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... |