传送门
题目描述
给你一个有 n n n个点的树,你可以每次删除一条边并连接两个点,用最少的操作次数使这棵树变成一个链状结构
分析
思维构造一直是短板啊,以后要注意加强
首先我们如果一个点只有一个子节点,那么这条链直接保存即可
如果一个点有两个子节点,那么我们就断开这个点和父节点,这样两个子节点就可以构成一条链,和祖宗节点连接即可
如果一个点有超过两个子节点,那就把其中两个节点合并成一条链,其他节点全部断开即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N], e[N * 2], ne[N * 2], idx;
VI ans;
int n;
int G;
int in[N];
void add(int x, int y) {
ne[idx] = h[x], e[idx] = y, h[x] = idx++;
}
int dfs(int u, int fa) {
int res = 0,t = u;
for(int i = h[u];~i;i = ne[i]) {
int j = e[i];
if(j == fa) continue;
int p = dfs(j,u);
if(!p) continue;
res++;
if(res == 1) t = p;
else if(res == 2) ans.pb(u),ans.pb(fa),ans.pb(p),ans.pb(G),G = t;
else ans.pb(j),ans.pb(u),ans.pb(j),ans.pb(G),G = p;
}
return res <= 1 ? t : 0;
}
int main() {
int Case;
read(Case);
while (Case--) {
read(n);
memset(h,-1,sizeof h);
ans.clear();
for (int i = 1; i <= n; i++) in[i] = 0;
for (int i = 1; i < n; i++) {
int a, b;
read(a), read(b);
add(a, b), add(b, a);
in[a]++, in[b]++;
}
G = 1;
while (in[G] != 1) G++;
dfs(G, -1);
int res = ans.size();
di(res / 4);
for (int i = 0; i < ans.size(); i += 4) {
printf("%d %d %d %d\n", ans[i], ans[i + 1], ans[i + 2], ans[i + 3]);
}
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/