#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;
using ll = long long;
void giai(int v, vector<int> &used, vector<vector<int>> &g, vector<int> &o) {
    o.push_back(v);
    used[v] = 1;
    for (auto i : g[v]) {
        if (used[i] == 0) {
            giai(i, used, g, o);
            o.push_back(v);
        }
    }
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
        int SIZE = 41;
        vector<int> used(SIZE, 0);
        vector<vector<int>> g(SIZE);
        for (int i = 0; i < M; i++) {
            g[A[i]].push_back(B[i]);
            g[B[i]].push_back(A[i]);
        }
        vector<int> o;
        giai(1, used, g, o);
        int n = (int)o.size();
        vector<vector<int>> ans(n, vector<int> (n, 0));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                ans[i][j] = o[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... |