zoukankan      html  css  js  c++  java
  • HDU 4496 D-City (并查集,水题)

    D-City

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
    Total Submission(s): 18    Accepted Submission(s): 15


    Problem Description
    Luxer is a really bad guy. He destroys everything he met. 
    One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects exactly two D-points. Luxer will destroy all the D-lines. The mayor of D-city wants to know how many connected blocks of D-city left after Luxer destroying the first K D-lines in the input. 
    Two points are in the same connected blocks if and only if they connect to each other directly or indirectly.
     
    Input
    First line of the input contains two integers N and M. 
    Then following M lines each containing 2 space-separated integers u and v, which denotes an D-line. 
    Constraints: 
    0 < N <= 10000 
    0 < M <= 100000 
    0 <= u, v < N. 
     
    Output
    Output M lines, the ith line is the answer after deleting the first i edges in the input.
     
    Sample Input
    5 10 0 1 1 2 1 3 1 4 0 2 2 3 0 4 0 3 3 4 2 4
     
    Sample Output
    1 1 1 2 2 2 2 3 4 5
    Hint
    The graph given in sample input is a complete graph, that each pair of vertex has an edge connecting them, so there's only 1 connected block at first. The first 3 lines of output are 1s because after deleting the first 3 edges of the graph, all vertexes still connected together. But after deleting the first 4 edges of the graph, vertex 1 will be disconnected with other vertex, and it became an independent connected block. Continue deleting edges the disconnected blocks increased and finally it will became the number of vertex, so the last output should always be N.
     
    Source
     
    Recommend
    liuyiding
     
     1 /* ***********************************************
     2 Author        :kuangbin
     3 Created Time  :2013/8/24 12:20:44
     4 File Name     :F:2013ACM练习比赛练习2013通化邀请赛1004.cpp
     5 ************************************************ */
     6 
     7 #include <stdio.h>
     8 #include <string.h>
     9 #include <iostream>
    10 #include <algorithm>
    11 #include <vector>
    12 #include <queue>
    13 #include <set>
    14 #include <map>
    15 #include <string>
    16 #include <math.h>
    17 #include <stdlib.h>
    18 #include <time.h>
    19 using namespace std;
    20 const int MAXN = 10010;
    21 int F[MAXN];
    22 int find(int x)
    23 {
    24     if(F[x] == -1)return x;
    25     return F[x] = find(F[x]);
    26 }
    27 pair<int,int>p[100010];
    28 int ans[100010];
    29 int main()
    30 {
    31     //freopen("in.txt","r",stdin);
    32     //freopen("out.txt","w",stdout);
    33     
    34     int n,m;
    35     while(scanf("%d%d",&n,&m) == 2)
    36     {
    37         memset(F,-1,sizeof(F));
    38         for(int i = 1;i <= m;i++)
    39         {
    40             scanf("%d%d",&p[i].first,&p[i].second);
    41         }
    42         ans[m] = n;
    43         for(int i = m;i > 1;i --)
    44         {
    45             int t1 = find(p[i].first);
    46             int t2 = find(p[i].second);
    47             if(t1 != t2)
    48             {
    49                 ans[i-1] = ans[i] - 1;
    50                 F[t1] = t2;
    51             }
    52             else ans[i-1] = ans[i];
    53         }
    54         for(int i = 1;i <= m;i++)
    55             printf("%d
    ",ans[i]);
    56     }
    57     return 0;
    58 }
  • 相关阅读:
    007 使用SpringMVC开发restful API五--异常处理
    006 使用SpringMVC开发restful API四--用户信息的修复与删除,重在注解的定义
    033 Url中特殊字符的处理
    005 使用SpringMVC开发restful API三--处理创建请求
    004 使用SpringMVC开发restful API二--编写用户详情
    003 使用SpringMVC开发restful API--查询用户
    032 报错
    018 easygui的使用
    017 异常的处理
    012 pandas与matplotlib结合制图
  • 原文地址:https://www.cnblogs.com/kuangbin/p/3279624.html
Copyright © 2011-2022 走看看