#include <algorithm>
#include <cctype>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <climits>
#include <vector>
using namespace std;
#define N 1000010
#define inf 10000000
inline void rd(int &ret)
{
char c;
do { c = getchar();
} while(c < '0' || c > '9');
ret = c - '0';
while((c=getchar()) >= '0' && c <= '9')
ret = ret * 10 + ( c - '0' );
}
struct Edge{
int to, nex;
}edge[N<<1];
int head[N], edgenum;
void add(int u, int v){
Edge E = {v, head[u]};
edge[edgenum] = E;
head[u] = edgenum++;
}
void init(){memset(head, -1, sizeof head); edgenum = 0;}
int fa[N], dep[N], child[N][4]; //child[i] 是i子树中标号最小的3个点
int subtree[N];
int belong[N];//belong[u] [把1删掉后剩下的子树中,u所在的子树] 中标号最小的点
int path[N]; //path[u] [把1删掉后剩下的子树中,u所在的子树] 去掉u到1的路径 剩下的最小点标
void dfs(int u, int Father, int deep){
fa[u] = Father; dep[u] = deep;
child[u][0] = child[u][1] = child[u][2] = inf;
for(int i = head[u]; ~i; i = edge[i].nex)
{
int v = edge[i].to;
if(v == Father || v==-1)continue;
dfs(v, u, deep+1);
child[u][3] = subtree[v];
sort(child[u], child[u]+4);
}
subtree[u] = min(u, child[u][0]);
}
void dp(int u, int fa){
for(int i = head[u]; ~i; i = edge[i].nex)
{
int v = edge[i].to; if(v == fa || v==-1)continue;
path[v] = min(path[u], child[u][subtree[v]==child[u][0]]);
belong[v] = belong[u];
dp(v, u);
}
path[u] = min(path[u], child[u][0]);
}
int n, q;
int main(){
int i, j, u, v;
while (scanf("%d%d", &n, &q) == 2) {
init();
for(i = 1; i < n; i++) {
rd(u); rd(v);
add(u, v);
add(v, u);
}
dfs(1, -1, 1);
path[1] = inf; belong[1] = -1;
for(i = head[1]; ~i; i = edge[i].nex)
{
u = edge[i].to;
path[u] = inf;
belong[u] = subtree[u];
dp(u, u);
}
int ans = 0;
while(q--)
{
rd(u); rd(v);
u ^= ans; v ^= ans;
if(u>v)swap(u,v);
if(u!=1 && belong[u]==belong[v])ans = 1;
else
{
i = 0;
while(child[1][i] == belong[u] || child[1][i]==belong[v])i++;
ans = u==1?path[v] : min(path[u], path[v]);
ans = min(ans, child[1][i]);
}
printf("%d\n", ans);
}
}
return 0;
}
存代码
最新推荐文章于 2022-12-15 22:38:22 发布