BZOJ_3872_[Poi2014]Ant colony_dfs

BZOJ_3872_[Poi2014]Ant colony_dfs

Description

There is an entrance to the ant hill in every chamber with only one corridor leading into (or out of) it. At each entry, there are g groups of m1,m2,...,mg ants respectively. These groups will enter the ant hill one after another, each successive group entering once there are no ants inside. Inside the hill, the ants explore it in the following way:

Upon entering a chamber with d outgoing corridors yet unexplored by the group, the group divides into d groups of equal size. Each newly created group follows one of the d corridors. If d=0, then the group exits the ant hill.

If the ants cannot divide into equal groups, then the stronger ants eat the weaker until a perfect division is possible. Note that such a division is always possible since eventually the number of ants drops down to zero. Nothing can stop the ants from allowing divisibility - in particular, an ant can eat itself, and the last one remaining will do so if the group is smaller than d.

The following figure depicts m ants upon entering a chamber with three outgoing unexplored corridors, dividing themselves into three (equal) groups of floor(m/3) ants each.

A hungry anteater dug into one of the corridors and can now eat all the ants passing through it. However, just like the ants, the anteater is very picky when it comes to numbers. It will devour a passing group if and only if it consists of exactly k ants. We want to know how many ants the anteater will eat.

给定一棵有n个节点的树。在每个叶子节点，有g群蚂蚁要从外面进来，其中第i群有m[i]只蚂蚁。这些蚂蚁会相继进入树中，而且要保证每一时刻每个节点最多只有一群蚂蚁。这些蚂蚁会按以下方式前进：

·在即将离开某个度数为d+1的点时，该群蚂蚁有d个方向还没有走过，这群蚂蚁就会分裂成d群，每群数量都相等。如果d=0，那么蚂蚁会离开这棵树。

·如果蚂蚁不能等分，那么蚂蚁之间会互相吞噬，直到可以等分为止，即一群蚂蚁有m只，要分成d组，每组将会有floor(m/d)只，如下图。

一只饥饿的食蚁兽埋伏在一条边上，如果有一群蚂蚁通过这条边，并且数量恰为k只，它就会吞掉这群蚂蚁。请计算一共有多少只蚂蚁会被吞掉。

Input

The first line of the standard input contains three integers n, g, k (2<=n,g<=1000000, 1<=k<=10^9), separated by single spaces. These specify the number of chambers, the number of ant groups and the number of ants the anteater devours at once. The chambers are numbered from 1 to n.

The second line contains g integers m[1],m[2],...,m[g](1<=m[i]<=10^9), separated by single spaces, where m[i] gives the number of ants in the i-th group at every entrance to the ant hill. The n-1 lines that follow describe the corridors within the ant hill; the i-th such line contains two integers a[i],b[i] (1<=a[i],b[i]<=n), separated by a single space, that indicate that the chambers no.a[i] and b[i] are linked by a corridor. The anteater has dug into the corridor that appears first on input.

第一行包含三个整数n,g,k,表示点数、蚂蚁群数以及k。

第二行包含g个整数m[1],m[2],...,m[g]，表示每群蚂蚁中蚂蚁的数量。

接下来n-1行每行两个整数，表示一条边，食蚁兽埋伏在输入的第一条边上。

Output

Your program should print to the standard output a single line containing a single integer: the number of ants eaten by the anteater.

一个整数，即食蚁兽能吃掉的蚂蚁的数量。

Sample Input

7 5 3
3 4 1 9 11
1 2
1 4
4 3
4 5
4 6
6 7

Sample Output

21

---

 倒过来做，以最后输入的两端为根dfs整棵树。

求出每个点的蚂蚁数目范围，满足最后走到根时恰好剩下k个蚂蚁。

对于最大值upper[to[i]]=upper[x]*(out[x]-1)+out[x]-2.out[x]表示x的度数。

对于最小值lower[to[i]]=lower[x]*(out[x]-1)。

可能中间过程爆longlong，当最小值比总数大的时候就不必继续dfs下去。

然后对于每个初始的叶子结点二分查找一下合法蚂蚁的个数。

 

代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char nc() {
    static char buf[100000],*p1,*p2;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd() {
    register int x=0;
    register char s=nc();
    while(s<'0'||s>'9')s=nc();
    while(s>='0'&&s<='9')x=(x<<3)+(x<<1)+s-'0',s=nc();
    return x;
}
#define N 1000050
typedef long long ll;
int head[N],to[N<<1],nxt[N<<1],out[N],cnt;
int m[N],n,g,k,root1,root2;
ll upper[N],lower[N];
inline void add(int u,int v) {
    to[++cnt]=v; nxt[cnt]=head[u]; head[u]=cnt; out[u]++;
}
void dfs(int x,int y) {
    int i;
    for(i=head[x];i;i=nxt[i]) {
        if(to[i]!=y) {
            upper[to[i]]=upper[x]*(out[x]-1)+out[x]-2;
            if(upper[to[i]]<0) upper[to[i]]=m[g];
            upper[to[i]]=min(upper[to[i]],1ll*m[g]);
            lower[to[i]]=lower[x]*(out[x]-1);
            if(lower[to[i]]<=m[g]&&lower[to[i]]>=0)
                dfs(to[i],x);
        }
    }
}
int search(ll x) {
    int l=1,r=g+1;
    while(l<r) {
        int mid=(l+r)>>1;
        if(m[mid]<=x) l=mid+1;
        else r=mid;
    }
    return l-1;
}
int main() {
    n=rd(); g=rd(); k=rd();
    int i,x,y;
    for(i=1;i<=g;i++) m[i]=rd();
    sort(m+1,m+g+1);
    root1=rd(); root2=rd();
    add(root1,root2); add(root2,root1);
    for(i=2;i<n;i++) {
        x=rd(); y=rd();
        add(x,y); add(y,x);
    }
    upper[root1]=upper[root2]=lower[root1]=lower[root2]=k;
    dfs(root1,root2);
    dfs(root2,root1);
    ll ans=0;
    for(i=1;i<=n;i++) if(out[i]==1) ans+=search(upper[i])-search(lower[i]-1);
    printf("%lld\n",ans*k);
}