Submission #1249569

#TimeUsernameProblemLanguageResultExecution timeMemory
1249569madamadam3World Map (IOI25_worldmap)C++20
15 / 100
14 ms2120 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; using vvi = vector<vi>; void dfs(int u, vector<bool> &vis, vvi &adj, vi &tour) { vis[u] = true; tour.push_back(u); for (int v : adj[u]) { if (vis[v]) continue; dfs(v, vis, adj, tour); tour.push_back(u); } } vvi create_map(int n, int m, vi a, vi b) { vvi adj(n+1, vi()); for (int i = 0; i < m; i++) adj[a[i]].push_back(b[i]), adj[b[i]].push_back(a[i]); vector<bool> vis(n+1, false); vi tour; dfs(1, vis, adj,tour); int K = tour.size(); vvi ans(K, vi(K, 1)); for (int i = 0; i < K; i++) { for (int j = 0; j < K; j++) { ans[i][j] = tour[j]; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...