Submission #917659

#TimeUsernameProblemLanguageResultExecution timeMemory
917659VMaksimoski008Network (BOI15_net)C++14
100 / 100
637 ms45664 KiB
#include <bits/stdc++.h> #define pb push_back using namespace std; int n, a, b, i; vector<int> L, G[500005]; void dfs(int u, int p) { for(int &v : G[u]) if(v != p) dfs(v, u); if(G[u].size() == 1) L.pb(u); } int main() { cin >> n; for(i=0; i<n-1; i++) { cin >> a >> b; G[a].pb(b); G[b].pb(a); } dfs(1, 0); int sz = L.size(); cout << (sz+1)/2 << '\n'; for(i=0; i<sz/2; i++) cout << L[i] << " " << L[i+sz/2] << '\n'; if(sz & 1) cout << L[0] << " " << L[sz-1] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...