#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back vector<int>adj[50]; vector<int>rt; void dfs(int a, int p){ for(auto b:adj[a]){ if(b==p)continue; rt.pb(a); dfs(b,a); } rt.pb(a); } std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { for(int i=1;i<=N;i++){ adj[i].clear(); } for(int i=0;i<M;i++){ adj[A[i]].pb(B[i]); adj[B[i]].pb(A[i]); } rt.clear(); dfs(1,0); int h=rt.size()*2; vector< vector< int> > v(h, vector<int> (h)); for(int i=0;i<rt.size();i++){ for(int j=0;j<h;j++){ v[i*2][j]=rt[i]; v[i*2][j+1]=rt[i]; } } return v; }