# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166822 | CrabCNH | Network (BOI15_net) | C++20 | 5 ms | 12100 KiB |
#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
using namespace std;
template <class T> void mini (T &t, T f) {if (t > f) t = f;}
template <class T> void maxi (T &t, T f) {if (t < f) t = f;}
const int maxN = 5e5 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
vector <int> adj[maxN], leaves;
void dfs (int u, int p) {
if (adj[u].size () == 1) {
leaves.push_back (u);
}
for (auto v : adj[u]) {
if (v != p) {
dfs (v, u);
}
}
}
void solve () {
int n;
cin >> n;
for (int i = 1; i <= n - 1; i ++) {
int u, v;
cin >> u >> v;
adj[u].push_back (v);
adj[v].push_back (u);
}
int rt = 1;
for (int i = 1; i <= n; i ++) {
if (adj[i].size () >= 2) {
rt = i;
break;
}
}
dfs (rt, rt);
int l = leaves.size ();
cout << (l + 1) / 2 << '\n';
for (int i = 0; i + 1 < l; i += 2) {
cout << leaves[i] << ' ' << leaves[i + 1] << '\n';
}
if (l % 2 == 1) {
cout << leaves[l - 1] << ' ' << leaves[0];
}
return;
}
signed main () {
cin.tie (nullptr) -> sync_with_stdio (false);
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
int t = 1;
//cin >> t;
while (t --) {
solve ();
}
return 0;
}
// thfdgb
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... |