zoukankan      html  css  js  c++  java
  • UVALive 5292 Critical Links

    Critical Links

    Time Limit: 3000ms
    Memory Limit: 131072KB
    This problem will be judged on UVALive. Original ID: 5292
    64-bit integer IO format: %lld      Java class name: Main

    In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and B such that all network interconnection paths between A and B pass through L. Removing a critical link generates two disjoint sub-networks such that any two servers of a sub-network are interconnected. For example, the network shown in figure 1 has three critical links that are marked bold: 0 -1,3 - 4 and 6 - 7.

    Figure 1: Critical links

    It is known that:

    1.
    the connection links are bi-directional;
    2.
    a server is not directly connected to itself;
    3.
    two servers are interconnected if they are directly connected or if they are interconnected with the same server;
    4.
    the network can have stand-alone sub-networks.


    Write a program that finds all critical links of a given computer network.

     

    Input

    The program reads sets of data from a text file. Each data set specifies the structure of a network and has the format:


    $no\_of\_servers$

    $server_0 (no\_of\_direct\_connections) connected\_server dots connected\_server$

    ...

    $server_{no\_of\_servers} (no\_of\_direct\_connections) connected\_server dots connected\_server$


    The first line contains a positive integer $no\_of\_servers$(possibly 0) which is the number of network servers. The next $no\_of\_servers$ lines, one for each server in the network, are randomly ordered and show the way servers are connected. The line corresponding to serverk$0 le k le no\_of\_servers - 1$, specifies the number of direct connections of serverk and the servers which are directly connected to serverk. Servers are represented by integers from 0 to $no\_of\_servers - 1$. Input data are correct. The first data set from sample input below corresponds to the network in figure 1, while the second data set specifies an empty network.

     

    Output

    The result of the program is on standard output. For each data set the program prints the number of critical links and the critical links, one link per line, starting from the beginning of the line, as shown in the sample output below. The links are listed in ascending order according to their first element. The output for the data set is followed by an empty line.
     

    Sample Input

    8
    0 (1) 1
    1 (3) 2 0 3
    2 (2) 1 3
    3 (3) 1 2 4
    4 (1) 3
    7 (1) 6
    6 (1) 7
    5 (0)
    
    0
    

    Sample Output

    3 critical links
    0 - 1
    3 - 4
    6 - 7
    
    0 critical links
    

    Source

     
    解题:求割边
     
     1 #include <bits/stdc++.h>
     2 #define pii pair<int,int>
     3 using namespace std;
     4 const int maxn = 10010;
     5 struct arc{
     6     int u,v,next;
     7     arc(int x = 0,int y = 0,int z = -1){
     8         u = x;
     9         v = y;
    10         next = z;
    11     }
    12 }e[500000];
    13 int head[maxn],dfn[maxn],low[maxn];
    14 int tot,idx,n,m;
    15 vector< pii >ans;
    16 void add(int u,int v){
    17     e[tot] = arc(u,v,head[u]);
    18     head[u] = tot++;
    19 }
    20 void tarjan(int u,int fa){
    21     dfn[u] = low[u] = ++idx;
    22     bool flag = true;
    23     for(int i = head[u]; ~i; i = e[i].next){
    24         if(e[i].v == fa && flag){
    25             flag = false;
    26             continue;
    27         }
    28         if(!dfn[e[i].v]){
    29             tarjan(e[i].v,u);
    30             low[u] = min(low[u],low[e[i].v]);
    31             if(low[e[i].v] > dfn[u]) ans.push_back(make_pair(min(e[i].v,e[i].u),max(e[i].u,e[i].v)));
    32         }else low[u] = min(low[u],dfn[e[i].v]);
    33     }
    34 }
    35 int main(){
    36     int u,v;
    37     while(~scanf("%d",&n)){
    38         ans.clear();
    39         memset(head,-1,sizeof(head));
    40         memset(low,0,sizeof(low));
    41         memset(dfn,0,sizeof(dfn));
    42         for(int i = tot = 0; i < n; ++i){
    43             scanf("%d (%d)",&u,&m);
    44             while(m--){
    45                 scanf("%d",&v);
    46                 add(u,v);
    47             }
    48         }
    49         for(int i = 1; i <= n; ++i)
    50             if(!dfn[i]) tarjan(i,-1);
    51         printf("%d critical links
    ",ans.size());
    52         sort(ans.begin(),ans.end());
    53         for(int i = 0; i < ans.size(); ++i)
    54             printf("%d - %d
    ",ans[i].first,ans[i].second);
    55         puts("");
    56     }
    57     return 0;
    58 }
    View Code
  • 相关阅读:
    自然二进制与格雷码的转换
    状态机小结
    FSM的几种策略
    跨越鸿沟:同步世界中的异步信号
    边沿检测技术
    门控时钟和时钟使能
    ALTERA器件中复位电路实现之-异步复位同步化
    同步复位
    Altera USB Blaster 仿真器(EPM240仿制版
    五、裸机烧写
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4394060.html
Copyright © 2011-2022 走看看