Submission #1250530

#TimeUsernameProblemLanguageResultExecution timeMemory
1250530fadyscubeWorld Map (IOI25_worldmap)C++20
15 / 100
14 ms2120 KiB
#include "worldmap.h" using namespace std; void dfs (int u, vector<vector<int>> &adj, vector<bool> &visited, vector<int> &ans) { visited[u] = true; ans.push_back(u+1); for (int i = 0; i < adj[u].size(); i++) { if (!visited[adj[u][i]]) { dfs(adj[u][i], adj, visited, ans); ans.push_back(u+1); } } } std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { vector<int> ans; vector<vector<int>> adj(N); for (int i = 0; i < M; i++) { adj[A[i]-1].push_back(B[i]-1); adj[B[i]-1].push_back(A[i]-1); } vector<bool> visited(N); dfs(0, adj, visited, ans); vector<vector<int>> v; for (int i = 0; i < ans.size(); i++) { v.push_back(ans); } return v; }
#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...