Submission #1249537

#TimeUsernameProblemLanguageResultExecution timeMemory
1249537Ghulam_JunaidWorld Map (IOI25_worldmap)C++20
15 / 100
59 ms7240 KiB
#include <bits/stdc++.h> #include "worldmap.h" using namespace std; const int N = 41, K = 240; int n, m; vector<int> g[N]; bool vis[N]; vector<int> path; void dfs(int v, int p = -1){ vis[v] = 1; path.push_back(v); for (int u : g[v]){ if (vis[u]){ path.push_back(u); path.push_back(v); continue; } dfs(u); path.push_back(v); } } vector<vector<int>> create_map(int nn, int mm, vector<int> a, vector<int> b) { n = nn, m = mm; for (int i = 0; i < m; i ++){ g[a[i]].push_back(b[i]); g[b[i]].push_back(a[i]); } dfs(1); int sz = path.size(); vector<vector<int>> ans(sz); for (int i = 0; i < sz; i ++) ans[i] = path; memset(vis, 0, sizeof vis); path.clear(); for (int i = 0; i <= n; i ++) g[i].clear(); 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...