最近公共祖先模版题。。我用的暴搜。过了
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>
typedef long long int ll;
const int maxn =10000+10;
const int mod =998244353;
const int INF=0x3f3f3f3f;
using namespace std;
ll pw(ll a,ll b){
ll ret=1;
while(b){
if(b&1)
ret=ret*a%mod;
a=a*a%mod;
b>>=1;
}
return ret;
}
int father[maxn];
bool vis[maxn];
int main()
{
int t;scanf("%d",&t);
while(t--)
{
memset(vis,false,sizeof(vis));
memset(father,-1,sizeof(father));
int n;scanf("%d",&n);int x,y,a,b;
for(int i=1;i<n;i++)
{
scanf("%d%d",&x,&y);
father[y]=x;
}
scanf("%d%d",&a,&b);
while(b!=-1)
{
vis[b]=true;
b=father[b];
}
while(!vis[a])
a=father[a];
printf("%d\n",a);
}
return 0;
}