Submission #830219

#TimeUsernameProblemLanguageResultExecution timeMemory
830219yusuf12360Network (BOI15_net)C++14
0 / 100
0 ms212 KiB
#include<bits/stdc++.h> #define int long long using namespace std; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<vector<int>> adj(n); vector<pair<int, int>> leaf, ans; map<int, int> mp; for(int i=1; i<n; i++) { int u, v; cin >> u >> v; --u; --v; adj[u].push_back(v); adj[v].push_back(u); } int cnt=0; for(int i=0; i<n; i++) { if(adj[i].size()>1) continue; leaf.push_back({adj[i][0], i}); cnt++; } sort(leaf.begin(), leaf.end()); for(int i=0; i<=cnt/2; i++) ans.push_back({leaf[i].second, leaf[i+cnt/2].second}); cout << ans.size() << '\n'; for(auto p : ans) cout << p.first+1 << ' ' << p.second+1 << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...