제출 #1262664

#제출 시각아이디문제언어결과실행 시간메모리
1262664abdelhakim세계 지도 (IOI25_worldmap)C++20
15 / 100
893 ms1659300 KiB
#include "worldmap.h" #include <bits/stdc++.h> #define ll long long #define dbg(x) cerr << #x << ' ' << x << endl; using namespace std; vector<int> v; vector<vector<ll>> adj; void dfs(ll node, ll par) { v.push_back(node+1); for (auto &&e : adj[node]) { if(e!=par) { dfs(e,node); v.push_back(node+1); } } } std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { v.clear(); adj.assign(N,vector<ll>()); for (int i=0;i<M;i++) { A[i]--; B[i]--; adj[A[i]].push_back(B[i]); adj[B[i]].push_back(A[i]); } dfs(0,0); vector<vector<int>> ans(v.size()); for (int i=0;i<ans.size();i++) { ans[i]=v; } 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...