# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544322 | inventiontime | Network (BOI15_net) | C++17 | 7 ms | 12116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define endl '\n'
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define re resize
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)
#define print(x) cout << #x << ": " << x << endl
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector<ti> vti;
typedef priority_queue<int> pq;
template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }
const int inf = 1e17;
const int maxn = 5e5+5;
vi adj[maxn];
void solve() {
int n; cin >> n;
loop1(i, n-1) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
vi leaves;
loop1(i, n)
if(adj[i].size() == 1)
leaves.pb(i);
cout << (leaves.size()+1) / 2 << endl;
loop(i, leaves.size()/2)
cout << leaves[i*2] << " " << leaves[i*2+1] << endl;
if(leaves.size() & 1)
cout << leaves[leaves.size()-1] << " " << leaves[leaves.size()-2] << endl;
}
signed main() {
fast_io;
int t = 1; //cin >> t;
while(t--)
solve();
cout << flush;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |