```cpp
#include<bits/stdc++.h>
using namespace std;
int f[2010][2010]={0};
int vis[1005]={0};
int ans=0;
int n,m;
int t;
int sum;
int a,b,c;
int sum_1;
void dfs(int cnt,int d)
{
for(int j=0;j<n;j++)
{
if(vis[j]==0 and f[cnt][j]==1)
{
if(cnt==d)
{
sum++;
return ;
}
vis[j]=1;
dfs(j,d);
}
}
}
int main()
{
scanf("%d%d",&n,&m);
memset(f,0,sizeof(f));
for(int i=0;i<n-1;i++)
{
f[i][i]=1;
int x;
int y;
scanf("%d%d",&x,&y);
f[x][y]=1;
f[y][x]=1;
}
for(int i=0;i<m;i++)
{
memset(vis,0,sizeof(vis));
scanf("%d%d%d",&a,&b,&c);
int t=0;
for(int j=1;j<=n;j++)
{
int ans=0x3f3f3f3f;
sum=0;
dfs(j,a);
sum_1+=sum;
sum=0;
dfs(j,b);
sum_1+=sum;
sum=0;
dfs(j,c);
sum_1+=sum;
if(ans>sum_1)
{
cout<<sum_1<<' ';
t=j;
ans=sum_1;
}
}
printf("%d %d\n",t,ans);
}
}
```
实在不会了
有没有dalao帮忙看一下，或者有码的？
qwq
by koukis @ 2021-08-18 10:57:31
图片好评
by int4096 @ 2021-08-18 11:07:06
@[int4096](/user/542452)
蟹蟹啊
by koukis @ 2021-08-18 11:13:41
@[int4096](/user/542452)
如果可以，就帮忙看看吧
by koukis @ 2021-08-18 11:15:59
本人表示太难了，我不会。。本人只会刷水题qwq
by int4096 @ 2021-08-18 11:19:54
@[int4096](/user/542452)
嗯嗯，我再想想，谢谢啦
by koukis @ 2021-08-18 11:22:11
@[koukis](/user/476684) 只要暴力向上找爹就行了吧
by 君と僕のNOIP @ 2021-10-10 19:06:39
@[koukis](/user/476684)
~~为什么不打下只有70+的树链剖分呢？~~（逃
by 君と僕のNOIP @ 2021-10-10 19:08:22
~~试一试三点bfs~~
by Francais_Drake @ 2021-11-13 17:43:41