Submission #1250137

#TimeUsernameProblemLanguageResultExecution timeMemory
1250137chithanhnguyenWorld Map (IOI25_worldmap)C++20
0 / 100
1 ms320 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; int n, m; vector<int> euler_tour; vector<int> adj[1005]; bool vis[1005]; void dfs(int u) { vis[u] = 1; euler_tour.push_back(u); for (int v : adj[u]) { if (!vis[v]) { dfs(v); euler_tour.push_back(u); } } } vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { n = N; m = M; for (int i = 0; i < m; ++i) { int u = A[i], v = B[i]; adj[u].push_back(v); adj[v].push_back(u); } vector<vector<int>> res(2*n-1, vector<int>(2*n-1)); for (int i = 0; i < 2 * n - 1; ++i) { for (int j = 0; j < 2 * n - 1; ++j) { res[i][j] = euler_tour[i]; } } return res; }
#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...