point:
离线处理,然后从头开始dfs,开栈来记当前的函数,然后回溯就pop出去。
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <stack>
using namespace std;
const int maxn = 1e6+55;
#define LL long long
int n, x;
vector <int> fa[maxn];
vector <int> f[maxn];
vector <int> cq[maxn];
struct node{
int u,r,ans;
}qu[maxn];
stack<int>q[1000200];
void dfs(int x)
{
for(int i=0;i<f[x].size();i++){
q[f[x][i]].push(x);
}
for(int i=0;i<cq[x].size();i++){
if(!q[qu[cq[x][i]].r].empty())
qu[cq[x][i]].ans=q[qu[cq[x][i]].r].top();
}
for(int i=0;i<fa[x].size();i++){
dfs(fa[x][i]);
}
for(int i=0;i<f[x].size();i++){
q[f[x][i]].pop();
}
}
int main()
{
scanf("%d",&n);
for(int i=2;i<=n;i++) {
scanf("%d",&x);
fa[x].push_back(i);
}
for(int i=1;i<=n;i++){
scanf("%d",&x);
for(int j=1;j<=x;j++){
int y;scanf("%d",&y);
f[i].push_back(y);
}
}
int q;scanf("%d",&q);
for(int i=1;i<=q;i++){
scanf("%d %d",&qu[i].u,&qu[i].r);
cq[qu[i].u].push_back(i);
}
dfs(1);
for(int i=1;i<=q;i++){
if(qu[i].ans==0) qu[i].ans = -1;
printf("%d\n",qu[i].ans);
}
return 0;
}
数组版本实现:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <utility>
using namespace std;
const int maxn = 1e6+55;
#define LL long long
int n, x;
vector <int> fa[maxn];
vector <int> f[maxn];
vector <int> cq[maxn];
typedef pair<int, int> pii;
struct node{
int u,r,id,ans;
}qu[maxn];
int pre[maxn],now[maxn];
void dfs(int x,int pre[])
{
vector <pii> tem;
for(int i=0;i<f[x].size();i++){
tem.push_back(make_pair(f[x][i], pre[f[x][i]]));
pre[f[x][i]]=x;
}
for(int i=0;i<cq[x].size();i++){
qu[cq[x][i]].ans=pre[qu[cq[x][i]].r];
//if(qu[cq[x][i]].ans==0)qu[cq[x][i]].ans = -1;
}
for(int i=0;i<fa[x].size();i++){
dfs(fa[x][i], pre);
}
for(int i=0;i<tem.size();i++){
pre[tem[i].first] = tem[i].second;
}
}
int main()
{
scanf("%d",&n);
for(int i=2;i<=n;i++) {
scanf("%d",&x);
fa[x].push_back(i);
}
for(int i=1;i<=n;i++){
scanf("%d",&x);
for(int j=1;j<=x;j++){
int y;scanf("%d",&y);
f[i].push_back(y);
}
}
int q;scanf("%d",&q);
for(int i=1;i<=q;i++){
scanf("%d %d",&qu[i].u,&qu[i].r);
cq[qu[i].u].push_back(i);
}
dfs(1,pre);
for(int i=1;i<=q;i++){
if(qu[i].ans==0) qu[i].ans = -1;
printf("%d\n",qu[i].ans);
}
return 0;
}