[可并堆] BZOJ 3011 [Usaco2012 Dec]Running Away From the Barn

最新推荐文章于 2018-06-02 17:18:25 发布

里阿奴摩西

最新推荐文章于 2018-06-02 17:18:25 发布

阅读量292

点赞数

分类专栏：可并堆

本文链接：https://blog.csdn.net/u014609452/article/details/51925530

版权

可并堆专栏收录该内容

8 篇文章 0 订阅

订阅专栏

复习下可并堆

想知道还有没有别的做法

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline void read(ll &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=200005;

struct node{
	ll val;
	node *l,*r;
}nodes[N],*root[N];

inline int ran() { static int x=31253125; x+=(x<<4)+1; return x&65536; }

inline node *M(node *p,node *q){
	return (!p||!q)?(p?p:q):(p->val<q->val?M(q,p):((ran()?p->r=M(p->r,q):p->l=M(p->l,q)),p));
}

struct edge{
	int u,v,next; ll w;
}G[N<<1];
int head[N],inum;

inline void add(int u,int v,ll w,int p) {
	G[p].u=u; G[p].v=v; G[p].w=w; G[p].next=head[u]; head[u]=p;
}


int n; ll L;
int size[N];

#define V G[p].v
inline void dfs(int u,ll d){
	nodes[u].val=d; size[u]=1; root[u]=nodes+u;
	for (int p=head[u];p;p=G[p].next)
	{
		dfs(V,d+G[p].w);
		root[u]=M(root[u],root[V]);
		size[u]+=size[V];
		while (root[u]->val>d+L)
			size[u]--,root[u]=M(root[u]->l,root[u]->r);
	}
}

int main()
{
	int pp; ll dd;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(L);
	for (int i=2;i<=n;i++)
		read(pp),read(dd),add(pp,i,dd,++inum);
	dfs(1,0);
	for (int i=1;i<=n;i++)
		printf("%d\n",size[i]);
	return 0;
}