2016 大连网赛---Weak Pair(dfs+树状数组)

题目链接

http://acm.split.hdu.edu.cn/showproblem.php?pid=5877

Problem Description

You are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An ordered pair of nodes (u,v) is said to be weak if
  (1) u is an ancestor of v (Note: In this problem a node u is not considered an ancestor of itself);
  (2) au×av≤k.

Can you find the number of weak pairs in the tree?

 

Input

There are multiple cases in the data set.
  The first line of input contains an integer T denoting number of test cases.
  For each case, the first line contains two space-separated integers, N and k, respectively.
  The second line contains N space-separated integers, denoting a1 to aN.
  Each of the subsequent lines contains two space-separated integers defining an edge connecting nodes u and v , where node u is the parent of node v.

Constrains: 
  1≤N≤105 
  0≤ai≤109 
  0≤k≤1018

 

Output

For each test case, print a single integer on a single line denoting the number of weak pairs in the tree.

 

Sample Input

1

2 3

1 2

1 2

 

Sample Output

1

 

题意：输入n，k  表示有n个节点的一棵树，然后输入n个节点的权值和n-1条边，求点对（u，v）的对数，满足：

      1、u是v的祖先节点。

      2、a[u]*a[v]<=k，a[]是存储权值的数组。

 

思路：从根节点开始向下深搜，每到一个点时计算sum+=Sum（a[i]）,Sum(x)表示大于等于x的个数，然后向树状数组中加入k/a[i]，继续递归深搜，退栈时从树状数组中减去k/a[i] ,这样可以保证树状数组中存的一直是一条到根节点的路径值。大题思路如上，这里要做一个离散化的处理，输入的权值<=1e9  k<=1e18  而只有1e5个点，所以可以离散到2*1e5 后处理；

 

题解中提示用treap计算大于等于x的个数，这样可以不需要进行离散化；

第一次自己做出深搜的题，挺高兴的^_^  看样子我对深搜有了一点认识了

 

代码如下：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <map>
using namespace std;
const long long maxn=;
long long root;
long long sum,k;
long long in[];
vector<long long>g[];
long long a[];
long long b[];

long long c[];
map<long long,long long>q;

long long Lowbit(long long t)
{
    return t&(t^(t-));
}
void add(long long x,long long t)
{
    while(x > )
    {
        c[x]+=t;
        x -= Lowbit(x);
    }
}
long long Sum(long long li)
{
    long long s=;
    while(li<)
    {
        s+=c[li];
        li=li+Lowbit(li);
    }
    return s;
}

void dfs(long long t)
{
    long long n=g[t].size();
    for(long long i=;i<n;i++)
    {
        long long v=g[t][i];
        sum+=(long long)Sum(q[a[v]]);
        if(a[v]==) add(maxn,);
        else   add(q[k/a[v]],);
        dfs(v);
        if(a[v]==) add(maxn,-);
        else   add(q[k/a[v]],-);
    }
}

int main()
{
    long long T,N;
    scanf("%lld",&T);
    while(T--)
    {
        q.clear();
        memset(in,,sizeof(in));
        memset(c,,sizeof(c));
        memset(b,,sizeof(b));
        scanf("%lld%lld",&N,&k);
        for(long long i=;i<=N;i++)
        {
            scanf("%lld",&a[i]);
            b[*i-]=a[i];
            if(a[i]!=)
            b[*i-]=k/a[i];
            g[i].clear();
        }
        sort(b,b+*N);
        long long tot=,pre=-;
        for(long long i=;i<*N;i++)
        {
            if(b[i]!=pre)
            {
                pre=b[i];
                q[pre]=++tot;
            }
        }
        for(long long i=;i<N-;i++)
        {
            long long aa,bb;
            scanf("%lld%lld",&aa,&bb);
            g[aa].push_back(bb);
            in[bb]++;
        }
        for(long long i=;i<=N;i++)
        if(in[i]==) { root=i; break; }

        sum=;
        if(a[root]==) add(maxn,);
        else   add(q[k/a[root]],);
        dfs(root);
        printf("%lld\n",sum);
    }
    return ;
}