E. Tree with Small Distances
由n个点和n-1条边组成的树,求最少添加多少条边,能使点1到其他点距离<=2
将所有距离>2的点降序排序,连接点1和距离>2的点的父节点
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<fstream>
#include<math.h>
#include<stack>
#include<queue>
#include<bitset>
#include<utility>
#include<set>
#include<map>
#include<sstream>
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
const double eps=0.0000000000001;
const ll mod=998244353;
const int N=200005;
int n;
struct Edge{
int y;
int nt;
};
Edge e[N<<1];
int head[N];
int dist[N];//dist[i]:点i到点1的距离
int pre[N];//pre[i]:点i的父节点
vector<pair<int,int> > a;
void add(int i,int x,int y){
e[i].y=y;
e[i].nt=head[x];
head[x]=i;
}
void get_dist(int x,int r){
//r为x的父节点
pre[x]=r;
for(int i=head[x];i!=-1;i=e[i].nt){
int y=e[i].y;
if(y==r)continue;
dist[y]=dist[x]+1;
if(dist[y]>2)a.push_back(make_pair(y,dist[y]));
get_dist(y,x);
}
}
void update(int x){
dist[x]=1;
for(int i=head[x];i!=-1;i=e[i].nt){
if(dist[e[i].y]>2)dist[e[i].y]=2;
}
}
bool cmp(pair<int,int> a, pair<int,int> b){
return a.second > b.second;
}
int get_ans(){
int ans=0;
sort(a.begin(),a.end(),cmp);
for(int i=0;i<a.size();i++){
int p=a[i].first;
if(dist[p]<=2)continue;
update(pre[p]);
ans++;
}
return ans;
}
int main(){
scanf("%d",&n);
int x,y;
int k=0;
memset(head,-1,sizeof(head));
for(int i=0;i<n-1;i++){
scanf("%d%d",&x,&y);
add(k,x,y);
k++;
add(k,y,x);
k++;
}
dist[1]=0;
get_dist(1,0);
printf("%d\n",get_ans());
return 0;
}
https://blog.csdn.net/qq_41552508/article/details/82079503(大佬解释)
一开始不用pre数组求父节点,认为只要与1距离比自己小,且与自己相连的点就是自己的父节点,没弄懂为什么这样会wa