Submission #1253202

#TimeUsernameProblemLanguageResultExecution timeMemory
1253202hectormedranoWorld Map (IOI25_worldmap)C++20
15 / 100
1174 ms2146492 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; vector<vector<int>> v; vector<int> ord; void DFS(int x, int y) { ord.push_back(y); for (int z : v[y]) { if (z != x) { DFS(y, z); ord.push_back(y); } } } vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { v.resize(N + 1); for (int i = 0;i < M;i++) { v[A[i]].push_back(B[i]); v[B[i]].push_back(A[i]); } DFS(-1, 1); vector<vector<int>> ans(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++) { ans[i][j] = ord[i]; } } v.clear(); ord.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...