제출 #1302464

#제출 시각아이디문제언어결과실행 시간메모리
1302464aaaaaaaa세계 지도 (IOI25_worldmap)C++20
0 / 100
1183 ms2069964 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; const int mxN = 42; vector<pair<int, int>> ord; vector<int> adj[mxN]; void dfs(int u, int par){ for(auto it : adj[u]){ if(it ^ par) { ord.push_back({u, par}); dfs(it, u); ord.push_back({par, u}); } } } vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { for(int i = 0; i < M; ++i){ adj[A[i]].push_back(B[i]); adj[B[i]].push_back(A[i]); } dfs(1, 0); vector<vector<int>> ans(max(1, (int) ord.size()), vector<int>(max(1, (int) ord.size()), 1)); //cout << ord.size() << "\n"; for(int i = 0; i < ord.size(); ++i){ ans[i][0] = ord[i].first; ans[i][1] = ord[i].second; for(int j = 2; j < ord.size(); ++j) ans[i][j] = ans[i][j - 1]; } for(int i = 1; i <= N; ++i) adj[i].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...