LOJ#2537. 「PKUWC2018」Minimax

题目
题解

#include<bits/stdc++.h>
using namespace std;
const int N=300002,NN=6000002,M=998244353,inv=796898467;
int lc[NN],rc[NN],s[NN],tag[NN],rt[N],tot,c[N][2],x,i,w[N],a[N],p,m,n;
inline char gc(){
	static char buf[100000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
	int x=0,fl=1;char ch=gc();
	for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
	for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
	return x*fl;
}
void mul(int x,int v){s[x]=1ll*s[x]*v%M,tag[x]=1ll*tag[x]*v%M;}
void down(int t){
	if (tag[t]!=1) mul(lc[t],tag[t]),mul(rc[t],tag[t]),tag[t]=1;
}
int calc(int t,int l,int r){
	if (l==r) return 1ll*l*a[l]%M*s[t]%M*s[t]%M;
	down(t);
	int mid=l+r>>1;
	return (calc(lc[t],l,mid)+calc(rc[t],mid+1,r))%M;
}
void ins(int &t,int l,int r,int v){
	if (!t) t=++tot,s[t]=tag[t]=1;
	if (l==r) return;
	int mid=l+r>>1;
	if (v<=mid) ins(lc[t],l,mid,v);
	else ins(rc[t],mid+1,r,v);
}
int merge(int x,int y,int sx,int sy){
	if (!x){
		mul(y,sx);
		return y;
	}
	if (!y){
		mul(x,sy);
		return x;
	}
	down(x),down(y);
	int x0=s[lc[x]],x1=s[rc[x]],y0=s[lc[y]],y1=s[rc[y]];//s[]在变，需要记录变之前的情况
	lc[x]=merge(lc[x],lc[y],(sx+1ll*(M+1-p)*x1%M)%M,(sy+1ll*(M+1-p)*y1%M)%M);
	rc[x]=merge(rc[x],rc[y],(sx+1ll*p*x0%M)%M,(sy+1ll*p*y0%M)%M);
	s[x]=s[lc[x]]+s[rc[x]];
	if (s[x]>=M) s[x]-=M;
	return x;
}
int solve(int u){
	if (!c[u][0]){
		ins(rt[u],1,m,lower_bound(a+1,a+m+1,w[u])-a);
		return rt[u];
	}
	int l=solve(c[u][0]);
	if (!c[u][1]) return l;
	int r=solve(c[u][1]);
	p=w[u];
	return merge(l,r,0,0);
}
int main(){
	n=rd();
	for (i=1;i<=n;i++) x=rd(),c[x][c[x][0]>0]=i;
	for (i=1;i<=n;i++){
		w[i]=rd();
		c[i][0]?w[i]=1ll*w[i]*inv%M:a[++m]=w[i];
	}
	sort(a+1,a+m+1);
	printf("%d",calc(solve(1),1,m));
}