看了其他大佬的错误，发现都不太一样，我在搜索过后还原了，但还是wa#8#9#10

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
typedef long long ll;
int n,fa[N];
ll f[N],sum[N];
char a[N];
vector<int>G[N];
stack<int>s;
void dfs(int u)
{
	int temp;
	if(a[u]=='(')s.push(u);
	else if(a[u]==')'){
		if(!s.empty()){
			temp=s.top();
			s.pop();
			f[u]=f[fa[temp]]+1;
		}
	}
	sum[u]=sum[fa[u]]+f[u];
	for(int i=0;i<G[u].size();i++)
	{
		int v=G[u][i];
		dfs(v);
	}
	if(a[u]=='(')s.pop();
	else if(a[u]==')')s.push(temp);
}
int main()
{
	//freopen("tree.in","r",stdin);
	//freopen("tree.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	for(int i=2;i<=n;i++)
	{
		cin>>fa[i];
		G[fa[i]].push_back(i);
	}
	dfs(1);
	ll ans=sum[1];
	for(int i=2;i<=n;i++)
	{
		ans=ans^(sum[i]*i);
	}
	cout<<ans<<'\n';
	return 0;
}