HDOJ 2196 Computer 树的直径

由树的直径定义可得,树上任意一点到树的直径上的两个端点之一的距离是最长的...

三遍BFS求树的直径并预处理距离.......

Computer

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3522    Accepted Submission(s): 1784

Problem Description

A school bought the first computer some time ago(so this computer‘s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Managers of school are anxious about slow functioning of the
net and want to know the maximum distance Si for which i-th computer needs to send signal (i.e. length of cable to the most distant computer). You need to provide this information.

Hint: the example input is corresponding to this graph. And from the graph, you can see that the computer 4 is farthest one from 1, so S1 = 3. Computer 4 and 5 are the farthest ones from 2, so S2 = 2. Computer 5 is the farthest one from 3, so S3 = 3. we also
get S4 = 4, S5 = 4.

Input

Input file contains multiple test cases.In each case there is natural number N (N<=10000) in the first line, followed by (N-1) lines with descriptions of computers. i-th line contains two natural numbers - number of computer, to which i-th computer is connected
and length of cable used for connection. Total length of cable does not exceed 10^9. Numbers in lines of input are separated by a space.

Output

For each case output N lines. i-th line must contain number Si for i-th computer (1<=i<=N).

Sample Input

5
1 1
2 1
3 1
1 1

Sample Output

3
2
3
4
4

Author

scnu

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;

const int maxn=20010;

struct Edge
{
  int to,next,w;
}edge[maxn*2];

int Adj[maxn],Size;

void init()
{
  memset(Adj,-1,sizeof(Adj)); Size=0;
}

void add_edge(int u,int v,int w)
{
  edge[Size].to=v;
  edge[Size].w=w;
  edge[Size].next=Adj[u];
  Adj[u]=Size++;
}

int dist_s[maxn],dist_t[maxn],dist[maxn];

int n;

bool vis[maxn];

int bfs1()
{
  int ret=1;
  queue<int> q;
  memset(vis,false,sizeof(vis));
  q.push(1);
  dist[1]=0;
  vis[1]=true;
  while(!q.empty())
    {
      int u=q.front(); q.pop();

      for(int i=Adj[u];~i;i=edge[i].next)
        {
          int v=edge[i].to;
          int c=edge[i].w;
          if(vis[v]) continue;
          dist[v]=dist[u]+c;
          vis[v]=true; q.push(v);
          if(dist[v]>dist[ret])
            ret=v;
        }
    }
  return ret;
}

int bfs2(int x)
{
  int ret=x;
  queue<int> q;
  memset(vis,false,sizeof(vis));
  q.push(x); vis[x]=true;
  dist_s[x]=0;
  while(!q.empty())
    {
      int u=q.front(); q.pop();
      for(int i=Adj[u];~i;i=edge[i].next)
        {
          int v=edge[i].to;
          int c=edge[i].w;
          if(vis[v]==true) continue;
          vis[v]=true;
          dist_s[v]=dist_s[u]+c;
          q.push(v);
          if(dist_s[v]>dist_s[ret])
            ret=v;
        }
    }
  return ret;
}

int bfs3(int x)
{
  int ret=x;
  queue<int> q;
  memset(vis,false,sizeof(vis));
  q.push(x); vis[x]=true;
  dist_t[x]=0;
  while(!q.empty())
    {
      int u=q.front(); q.pop();
      for(int i=Adj[u];~i;i=edge[i].next)
        {
          int v=edge[i].to;
          int c=edge[i].w;
          if(vis[v]==true) continue;
          vis[v]=true;
          dist_t[v]=dist_t[u]+c;
          q.push(v);
          if(dist_t[v]>dist_t[ret])
            ret=v;
        }
    }
  return ret;
}

int main()
{
  while(scanf("%d",&n)!=EOF)
    {
      init();
      memset(dist_s,0,sizeof(dist_s));
      memset(dist_t,0,sizeof(dist_t));
      memset(dist,0,sizeof(dist));

      for(int i=2;i<=n;i++)
        {
          int x,w;
          scanf("%d%d",&x,&w);
          add_edge(x,i,w);
          add_edge(i,x,w);
        }

      int s=bfs1();
      int t=bfs2(s);
      bfs3(t);
      //cout<<"s: "<<s<<"  t: "<<t<<endl;
      for(int i=1;i<=n;i++)
        {
          printf("%d\n",max(dist_s[i],dist_t[i]));
        }
    }
  return 0;
}
时间: 2024-10-16 12:51:00

HDOJ 2196 Computer 树的直径的相关文章

hdu 2196 Computer 树的直径

Computer Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers

hdu2196 Computer(树的直径||树中的最长路径)

Computer Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5232    Accepted Submission(s): 2640 Problem Description A school bought the first computer some time ago(so this computer's id is 1). D

hdoj 2196 Computer【树的直径求所有的以任意节点为起点的一个最长路径】

Computer Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4440    Accepted Submission(s): 2236 Problem Description A school bought the first computer some time ago(so this computer's id is 1). Du

hdu 2196 computer 树状dp

Computer Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3731    Accepted Submission(s): 1886 Problem Description A school bought the first computer some time ago(so this computer's id is 1). Du

codeforces GYM 100114 J. Computer Network 无相图缩点+树的直径

题目链接: http://codeforces.com/gym/100114 Description The computer network of “Plunder & Flee Inc.” consists of n servers and m two-way communication links. Two servers can communicate either through a direct link, or through a chain of links, by relayi

【HDOJ2196】Computer(树的直径,树形DP)

题意:给定一棵N个点树,询问这个树里面每个点到树上其他点的最大距离. n<=10000 思路:设f[u,1],f[u,2]为以U为根向下的最长与次长,g[u,1],g[u,2]为从哪个儿子转移来 第一次dfs用V更新U,第二次dfs用U更新V,因为有V向U往上走的情况,这样做就可以处理了 可以发现这些数值中取最大值就是树的直径了 1 var f,g:array[1..21000,1..2]of longint; 2 head,vet,next,len:array[1..21000]of long

codeforces GYM 100114 J. Computer Network tarjan 树的直径 缩点

J. Computer Network Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100114 Description The computer network of “Plunder & Flee Inc.” consists of n servers and m two-way communication links. Two servers can communicate either thr

HDOJ 题目4123 Bob’s Race(树的直径+RMQ优化)

Bob's Race Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2753    Accepted Submission(s): 888 Problem Description Bob wants to hold a race to encourage people to do sports. He has got trouble

hdoj 4612 Warm up【双连通分量求桥&amp;&amp;缩点建新图求树的直径】

Warm up Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5093    Accepted Submission(s): 1131 Problem Description N planets are connected by M bidirectional channels that allow instant transport