玄关，10分铅条

#include <bits/stdc++.h>
using namespace std;
const int N=200010;
long long n,a[N],sr,p[N];
long long ts1;
char opt; 
vector<long long> edge[N];
long long jl[N],lian[N],dp[N];
long long ed,he;
long long ans;
bool flag;
void dfs(long long now){
	dp[now]=dp[jl[ed]];
	flag=1;
	if(he>0){
		if(a[jl[he]]==0&&a[now]==1){
			p[ed+1]=he;
			dp[now]+=lian[he-1];
			++dp[now];
			jl[++ed]=now;
			lian[ed]=1+lian[he-1];	
			ans=(ans^(now*dp[now]));
			he=(he-1)-2*lian[he-1];
			flag=0;
		}
	}
	if(flag){
		jl[++ed]=now;
		lian[ed]=0;
		p[ed]=0;
		he=ed;
		ans=(ans^(now*dp[now]));
	}
	for(long long to:edge[now]){
		dfs(to);
	}
	if(p[ed]){
		he=p[ed];
	}
	else{
		--he;
		if(p[he]){
			he=he-lian[he]*2;
		}
	}
	p[ed]=0;
	lian[ed]=0;
	jl[ed]=0;
	--ed;
	return ;
}
int main(){
//	freopen("brackets.in","r",stdin);
//	freopen("brackets.out","w",stdout); 
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	for(long long i=1;i<=n;++i){
		cin>>opt;
		a[i]=((opt=='(')?0:1);
	}
	for(long long i=2;i<=n;++i){
		cin>>sr;
		edge[sr].push_back(i);
	}
	dfs(1);
	cout<<ans;
	return 0;
}

50

))()(())((((()))))))((())))()))((()(()((((((())())

1 2 1 2 2 6 6 6 6 10 10 10 7 13 13 10 13 15 18 18 20 17 19 10 25 26 27 25 25 25 31 29 30 34 25 34 29 25 30 39 38 41 34 36 35 43 44 25 44

234

160