BZOJ P4756 [Usaco2017 Jan] Promotion Counting 【分块】

最新推荐文章于 2018-11-06 11:58:03 发布

「已注销」

最新推荐文章于 2018-11-06 11:58:03 发布

阅读量188

点赞数 1

分类专栏： OI/ACM之分治

本文链接：https://blog.csdn.net/yanzhenhuai/article/details/82724122

版权

OI/ACM之分治专栏收录该内容

25 篇文章 0 订阅

订阅专栏

简单分块：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define repd(i,x,y) for(ll i=(x);i>=(y);i--)
using namespace std;
const int N=1e5+5;

ll n,s,snum,a[N],b[N],v[N],l[N],r[N],block[N];

ll tim,in[N],out[N],dfn[N];

ll cnt,to[N],nxt[N],head[N];

inline ll read() {
    ll x=0;char ch=getchar();bool f=0;
    while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
    return f?-x:x;
}

void ins(ll x,ll y) {
	to[++cnt]=y;nxt[cnt]=head[x];head[x]=cnt;
}

void dfs(ll x,ll fa) {
	in[x]=++tim;dfn[tim]=x;
	for(ll i=head[x];i;i=nxt[i]) if(to[i]!=fa) dfs(to[i],x);
	out[x]=tim;
}

ll find(ll x,ll num) {
	ll left=l[x],right=r[x];
	
	while(left<=right) {
		ll mid=left+right>>1;
		
		if(b[mid]>num) right=mid-1;
		else if(b[mid]<num) left=mid+1;
		else return mid;
	}
	return left;
}

void getcnt(ll p) {
	ll ans=0,x=in[p],y=out[p];
	
	if(block[x]==block[y]) {
		rep(i,x,y) if(a[i]>v[p]) ans++;
	} else {
		rep(i,x,r[block[x]]) if(a[i]>v[p]) {
			ans++;
		}
		rep(i,l[block[y]],y) if(a[i]>v[p]) {
			ans++;
		}
		rep(i,block[x]+1,block[y]-1) {
			ll pos=lower_bound(b+l[i],b+1+r[i],v[p])-b;
			ans=ans+(r[i]+1-pos);
		}
	}
	
	printf("%lld\n",ans);
}

void File() {
	 freopen("count.in","r",stdin);
	 freopen("count.out","w",stdout);
}

int main() {
//	File();
	
	n=read();
	s=sqrt(n),snum=n/s;
	
	if(s*snum!=n) snum++;
	
	rep(i,1,n) v[i]=read(),block[i]=(i-1)/s+1;
	
	rep(i,2,n) {
		ll fa=read();ins(fa,i);
	}

	dfs(1,0);
	
	rep(i,1,n) a[i]=b[i]=v[dfn[i]];
	
	rep(i,1,snum) l[i]=(i-1)*s+1,r[i]=i*s;r[snum]=n;
	
	rep(i,1,snum) sort(b+l[i],b+1+r[i]);
	
	rep(i,1,n) 
		getcnt(i);
	
	return 0;
}