Submission #1296987

#TimeUsernameProblemLanguageResultExecution timeMemory
1296987kaxiWorld Map (IOI25_worldmap)C++20
0 / 100
1206 ms2102868 KiB
#include<bits/stdc++.h> using namespace std; vector<int> ans; vector<int> v[41]; void rec(int u, int p) { for(int i = 0; i < v[p].size(); i++) { if(v[p][i] != u){ ans.push_back(p); rec(p, v[p][i]); } } if(p != 1) ans.push_back(p); } vector<vector<int>> create_map(int n, int m, vector <int> a, vector<int> b) { if(m == 0) { vector <vector<int>> v1(1, vector<int>(1,1)); return v1; } for(int i = 0; i <= 40; i++) v[i].clear(); for(int i = 0; i < m; i++) { v[a[i]].push_back(b[i]); v[b[i]].push_back(a[i]); } ans.clear(); rec(0, 1); int k = ans.size(); vector <vector<int>> ans1(n, vector<int>(k)); for(int i = 0; i < ans.size(); i++) { for(int j = 0; j < ans.size(); j++){ ans1[i][j] = ans[j]; } } return ans1; }
#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...