zoukankan      html  css  js  c++  java
  • HDU 4738 无向图的桥

    Caocao's Bridges

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1876    Accepted Submission(s): 679


    Problem Description
    Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another idea. He built many islands in the Changjiang river, and based on those islands, Caocao's army could easily attack Zhou Yu's troop. Caocao also built bridges connecting islands. If all islands were connected by bridges, Caocao's army could be deployed very conveniently among those islands. Zhou Yu couldn't stand with that, so he wanted to destroy some Caocao's bridges so one or more islands would be seperated from other islands. But Zhou Yu had only one bomb which was left by Zhuge Liang, so he could only destroy one bridge. Zhou Yu must send someone carrying the bomb to destroy the bridge. There might be guards on bridges. The soldier number of the bombing team couldn't be less than the guard number of a bridge, or the mission would fail. Please figure out as least how many soldiers Zhou Yu have to sent to complete the island seperating mission.
     
    Input
    There are no more than 12 test cases.

    In each test case:

    The first line contains two integers, N and M, meaning that there are N islands and M bridges. All the islands are numbered from 1 to N. ( 2 <= N <= 1000, 0 < M <= N2 )

    Next M lines describes M bridges. Each line contains three integers U,V and W, meaning that there is a bridge connecting island U and island V, and there are W guards on that bridge. ( U ≠ V and 0 <= W <= 10,000 )

    The input ends with N = 0 and M = 0.
     
    Output
    For each test case, print the minimum soldier number Zhou Yu had to send to complete the mission. If Zhou Yu couldn't succeed any way, print -1 instead.
     
    Sample Input
    3 3 1 2 7 2 3 4 3 1 4 3 2 1 2 7 2 3 4 0 0
     
    Sample Output
    -1 4
     
    Source
     

     注意:

    1.有重边;

    2.至少要去一个士兵;

    3.图不连通就不用去了;

     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cstdlib>
     6 #include<vector>
     7 #include<map>
     8 using namespace std;
     9 const int maxn=1007;
    10 const int inf=0x3f3f3f3;
    11 struct node
    12 {
    13     int to,cost,next;
    14 };
    15 node edge[maxn*maxn];
    16 int head[maxn],n,m,num,ans,sum,pre[maxn],child,low[maxn];
    17 void addedge(int u,int v,int c)
    18 {
    19     edge[num].to=v;edge[num].cost=c;edge[num].next=head[u];
    20     head[u]=num++;
    21     edge[num].to=u;edge[num].cost=c;edge[num].next=head[v];
    22     head[v]=num++;
    23 }
    24 void tarjan(int u,int fa)
    25 {
    26     child++;
    27     low[u]=pre[u]=sum++;
    28     for(int i=head[u];i!=-1;i=edge[i].next)
    29     {
    30         int v=edge[i].to;
    31         if(i==(fa^1)) continue;
    32         if(!pre[v]){
    33             tarjan(v,i);
    34             low[u]=min(low[u],low[v]);
    35             if(pre[u]<low[v]){
    36                 ans=min(ans,edge[i].cost);
    37             }
    38         }
    39         else low[u]=min(low[u],low[v]);
    40     }
    41 }
    42 int main()
    43 {
    44     int a,b,c;
    45     while(~scanf("%d%d",&n,&m)){
    46         if(n==0&&m==0) break;
    47         memset(head,-1,sizeof(head));
    48         memset(pre,0,sizeof(pre));
    49         memset(low,0,sizeof(low));
    50         ans=inf;child=0;sum=1;
    51         for(int i=1;i<=m;i++)
    52         {
    53             scanf("%d%d%d",&a,&b,&c);
    54             addedge(a,b,c);
    55         }
    56         tarjan(1,-1);
    57         if(child<n) printf("0
    ");
    58         else if(ans==inf) printf("-1
    ");
    59         else if(ans==0) printf("1
    ");
    60         else printf("%d
    ",ans);
    61     }
    62     return 0;
    63 }
  • 相关阅读:
    RabbitMQ安装与配置
    在Web项目中使用shiro
    solr整合spring
    mycat
    SpringSession管理
    Nginx安装与配置(Nginx服务器和Tomcat服务器是不同的服务器)
    dubbo负载均衡与服务降级以及Zookeeper认证
    小笔记
    SpringMVC路径转发与重定向
    java-同步控制及不可变设置(只读访问)
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4385504.html
Copyright © 2011-2022 走看看