#include<bits/stdc++.h>
using namespace std;
#define pb push_back
vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
vector<vector<int>> graph(n+1);
for (int i = 0; i < m; i++) {
graph[a[i]].pb(b[i]);
graph[b[i]].pb(a[i]);
}
vector<int> subans;
vector<vector<bool>> conn(n+1, vector<bool> (n+1, false));
auto dfs = [&](auto &dfs, int u) -> void {
subans.pb(u);
for (int e : graph[u]) {
if (!conn[u][e]) {
conn[u][e] = true;
conn[e][u] = true;
dfs(dfs, e);
subans.pb(u);
}
}
};
dfs(dfs, 1);
vector<vector<int>> ans(subans.size(), subans);
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... |