zoukankan      html  css  js  c++  java
  • Network

    Network
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 7471   Accepted: 2729

    Description

    A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by successive links, so data can be transformed between any two computers. The administrator finds that some links are vital to the network, because failure of any one of them can cause that data can't be transformed between some computers. He call such a link a bridge. He is planning to add some new links one by one to eliminate all bridges.

    You are to help the administrator by reporting the number of bridges in the network after each new link is added.

    Input

    The input consists of multiple test cases. Each test case starts with a line containing two integers N(1 ≤ N ≤ 100,000) and M(N - 1 ≤ M ≤ 200,000).
    Each of the following M lines contains two integers A and B ( 1≤ AB ≤ N), which indicates a link between computer A and B. Computers are numbered from 1 to N. It is guaranteed that any two computers are connected in the initial network.
    The next line contains a single integer Q ( 1 ≤ Q ≤ 1,000), which is the number of new links the administrator plans to add to the network one by one.
    The i-th line of the following Q lines contains two integer A and B (1 ≤ ABN), which is the i-th added new link connecting computer A and B.

    The last test case is followed by a line containing two zeros.

    Output

    For each test case, print a line containing the test case number( beginning with 1) and Q lines, the i-th of which contains a integer indicating the number of bridges in the network after the first i new links are added. Print a blank line after the output for each test case.

    Sample Input

    3 2
    1 2
    2 3
    2
    1 2
    1 3
    4 4
    1 2
    2 1
    2 3
    1 4
    2
    1 2
    3 4
    0 0

    Sample Output

    Case 1:
    1
    0
    
    Case 2:
    2
    0

    Source

    network中有许多computer,之间或间接的连接,问有哪两个电脑之间的连接对整个network的连通性有影响,就是求桥,过程中加边,桥的值更新
      1 #include <iostream>
      2 #include <cstdlib>
      3 #include <cstdio>
      4 #include <algorithm>
      5 #include <vector>
      6 #include <queue>
      7 #include <cmath>
      8 #include <stack>
      9 #include <cstring>
     10 
     11 using namespace std;
     12 
     13 #define INF 0xfffffff
     14 #define min(a,b) (a<b?a:b)
     15 #define N 100005
     16 
     17 vector<vector<int> > G;
     18 
     19 int n, m, ans, Time;
     20 int low[N], dfn[N], f[N], bridge[N];
     21 
     22 void init()
     23 {
     24     G.clear();
     25     G.resize(n+1);
     26     Time = ans = 0;
     27     memset(low, 0, sizeof(low));
     28     memset(dfn, 0, sizeof(dfn));
     29     memset(f, 0, sizeof(f));
     30     memset(bridge, 0, sizeof(bridge));
     31 }
     32 
     33 void Tarjan(int u, int fa)
     34 {
     35     f[u] = fa;
     36     low[u] = dfn[u] = ++Time;
     37     int len = G[u].size(), v, k = 0;
     38 
     39     for(int i = 0; i < len; i++)
     40     {
     41         v = G[u][i];
     42 
     43         if(v == fa && k == 0)    // 如果这个点和父节点一样说明统计过了,就不用管了,毕竟这是一个双向图
     44         {
     45             k++;
     46             continue;
     47         }
     48         if(!low[v])
     49         {
     50             Tarjan(v, u);
     51             low[u] = min(low[v], low[u]);
     52             if(low[v] > dfn[u])
     53             {
     54                 bridge[v]++;   // 如果是桥,标志,ans++
     55                 ans++;
     56             }
     57         }
     58         else
     59             low[u] = min(low[u], dfn[v]);
     60     }
     61 }
     62 
     63 void Lca(int l, int r)
     64 {
     65     if(l == r)
     66         return ;
     67     if(dfn[l] > dfn[r])
     68     {
     69         if(bridge[l] == 1)
     70         {
     71             bridge[l] = 0;   // 随之更新
     72             ans--;
     73         }
     74         Lca(f[l], r);
     75     }
     76     else
     77     {
     78         if(bridge[r] == 1)
     79         {
     80             bridge[r] = 0;
     81             ans--;
     82         }
     83         Lca(l, f[r]);
     84     }
     85 }
     86 
     87 int main()
     88 {
     89     int a, b, x, y, q, t = 1;
     90 
     91     while(scanf("%d%d", &n, &m), n+m)
     92     {
     93         init();
     94 
     95         printf("Case %d:
    ", t);
     96         t++;
     97 
     98         while(m--)
     99         {
    100             scanf("%d%d", &a, &b);
    101             G[a].push_back(b);
    102             G[b].push_back(a);
    103         }
    104         Tarjan(1, 0);
    105         scanf("%d", &q);
    106 
    107         while(q--)
    108         {
    109             scanf("%d%d", &x, &y);
    110             Lca(x, y);
    111             printf("%d
    ", ans);
    112         }
    113     }
    114     return 0;
    115 }
    让未来到来 让过去过去
  • 相关阅读:
    git 生成公钥与私钥
    Swagger PHP使用指南
    数据库需要支持emoji表情
    Lumen实现用户注册登录认证
    Laraver 框架资料
    php curl请求。header头中添加请求信息
    linux 下看所有用户 及所有组
    瀑布流下滑 发送ajax
    Linux系统中的wc
    Nginx 日志分析及性能排查
  • 原文地址:https://www.cnblogs.com/Tinamei/p/4717809.html
Copyright © 2011-2022 走看看