2014西安网络预选赛1009（点分治）HDU5016

最新推荐文章于 2020-01-31 16:38:41 发布

cq_phqg

最新推荐文章于 2020-01-31 16:38:41 发布

阅读量1.4k

点赞数

分类专栏：树的分治文章标签： ACM hdu

本文链接：https://blog.csdn.net/cq_phqg/article/details/39525091

版权

树的分治专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Mart Master II

Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 167 Accepted Submission(s): 63

Problem Description

Trader Dogy lives in city S, which consists of n districts. There are n - 1 bidirectional roads in city S, each connects a pair of districts. Indeed, city S is connected, i.e. people can travel between every pair of districts by roads.

In some districts there are marts founded by Dogy’s competitors. when people go to marts, they’ll choose the nearest one. In cases there are more than one nearest marts, they’ll choose the one with minimal city number.

Dogy’s money could support him to build only one new marts, he wants to attract as many people as possible, that is, to build his marts in some way that maximize the number of people who will choose his mart as favorite. Could you help him?

Input

There are multiple test cases. Please process till EOF.

In each test case:

First line: an integer n indicating the number of districts.

Next n - 1 lines: each contains three numbers b _i, e _i and w _i, (1 ≤ b _i,e _i ≤ n,1 ≤ w _i ≤ 10000), indicates that there’s one road connecting city b _i and e _i, and its length is w _i.

Last line : n(1 ≤ n ≤ 10 ⁵) numbers, each number is either 0 or 1, i-th number is 1 indicates that the i-th district has mart in the beginning and vice versa.

Output

For each test case, output one number, denotes the number of people you can attract, taking district as a unit.

Sample Input

Sample Output

题意：给出n个点的树，有些点已经有了市场，而每个点都会被它最近的市场统治，现在要找一个点建市场，使得能统治最多的点

思路：又是一道树分治类型的题目，这种题目一直是难点也是热点吧

首先要预处理，即求出每个点被哪些市场统治了，可以用pair来存，代码里为du[]数组，第一维是距离，第二维是被哪个点统治，这个用树形DP很容易求得

然后就是树分治的部分

对于每一个分治中心C，要求的就是点u能不能通过C被v统治

可以先一遍DFS扫一遍所有点，然后如果du[u]>=dis[u]则将该点加入vector，其中dis[u]是u与分治中心C的距离

然后就可以一个分支一个分支的求了，对一个分支里面的每个点可以通过在vector上二分找到能统治的所有点的数量

但是会算重复，因为它会将该条分支满足的点也算进去

所以在求之前要先在这条分支上扫一遍所有点，将满足上述公式的点加入另一个vector

然后算的时候只需要用总的减去该条分支的即可

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
        
          #include 
         
           #include 
           using namespace std; typedef pair 
           
             pi; const int MAXN = 100010; const int INF = ~0U>>1; int head[MAXN]; int edge[MAXN<<1]; int next[MAXN<<1]; int ww[MAXN<<1]; int is[MAXN]; int num[MAXN]; int cnum[MAXN]; int vis[MAXN]; int ans[MAXN]; int tot; int center; int amx; int esz; pi du[MAXN]; void init() { memset(vis,0,sizeof(vis)); memset(ans,0,sizeof(ans)); memset(is,0,sizeof(is)); memset(head,-1,sizeof(head)); memset(du,0,sizeof(du)); esz=0; } void addedge(int u,int v,int w) { edge[esz]=v; ww[esz]=w; next[esz]=head[u]; head[u]=esz++; } void getdu(int u,int p) { du[u] = is[u] ? make_pair(0,u):make_pair(INF,INF); for(int i=head[u];i!=-1;i=next[i]){ int v=edge[i]; if(v==p)continue; getdu(v,u); pi pii=make_pair(du[v].first==INF?du[v].first:du[v].first+ww[i],du[v].second); if(pii 
            
              cnum[u])cnum[u]=num[v]; } } void getcenter(int u,int p) { int mx=max(tot-num[u],cnum[u]); if(mx 
             
               all; vector 
              
                sub; int dis[MAXN]; void dfs1(int u,int p,int w) { dis[u]=dis[p]+w; if(dis[u]<=du[u].first)all.push_back(make_pair(du[u].first-dis[u],du[u].second)); for(int i=head[u];i!=-1;i=next[i]){ int v=edge[i]; if(v==p || vis[v])continue; dfs1(v,u,ww[i]); } } void dfs2(int u,int p) { if(dis[u]<=du[u].first)sub.push_back(make_pair(du[u].first-dis[u],du[u].second)); for(int i=head[u];i!=-1;i=next[i]){ int v=edge[i]; if(v==p || vis[v])continue; dfs2(v,u); } } int fx(int u) { return all.end()-lower_bound(all.begin(),all.end(),make_pair(dis[u],u)); } int gx(int u) { return sub.end()-lower_bound(sub.begin(),sub.end(),make_pair(dis[u],u)); } void dfs3(int u,int p) { ans[u]+=fx(u)-gx(u); for(int i=head[u];i!=-1;i=next[i]){ int v=edge[i]; if(v==p || vis[v])continue; dfs3(v,u); } } void solve(int u) { center=u; getnum(u,0); tot=num[u]; amx=tot-1; getcenter(u,0); dis[center]=0; all.clear(); dfs1(center,0,0); sort(all.begin(),all.end()); ans[center]+=fx(center); for(int i=head[center];i!=-1;i=next[i]){ int v=edge[i]; if(vis[v])continue; sub.clear(); dfs2(v,center); sort(sub.begin(),sub.end()); dfs3(v,center); } vis[center]=1; for(int i=head[center];i!=-1;i=next[i]){ int v=edge[i]; if(vis[v])continue; solve(v); } } int main() { int n; while(scanf("%d",&n)!=EOF){ init(); for(int i=1;i 
               
                 an)an=ans[i]; } printf("%d\n",an); } return 0; }