zoukankan      html  css  js  c++  java
  • POJ2594Treasure Exploration(最小路径覆盖,相交)

    Treasure Exploration

    Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never know what fun treasure exploring brings to you. 
    Recently, a company named EUC (Exploring the Unknown Company) plan to explore an unknown place on Mars, which is considered full of treasure. For fast development of technology and bad environment for human beings, EUC sends some robots to explore the treasure. 
    To make it easy, we use a graph, which is formed by N points (these N points are numbered from 1 to N), to represent the places to be explored. And some points are connected by one-way road, which means that, through the road, a robot can only move from one end to the other end, but cannot move back. For some unknown reasons, there is no circle in this graph. The robots can be sent to any point from Earth by rockets. After landing, the robot can visit some points through the roads, and it can choose some points, which are on its roads, to explore. You should notice that the roads of two different robots may contain some same point. 
    For financial reason, EUC wants to use minimal number of robots to explore all the points on Mars. 
    As an ICPCer, who has excellent programming skill, can your help EUC?

    Input

    The input will consist of several test cases. For each test case, two integers N (1 <= N <= 500) and M (0 <= M <= 5000) are given in the first line, indicating the number of points and the number of one-way roads in the graph respectively. Each of the following M lines contains two different integers A and B, indicating there is a one-way from A to B (0 < A, B <= N). The input is terminated by a single line with two zeros.

    Output

    For each test of the input, print a line containing the least robots needed.

    Sample Input

    1 0
    2 1
    1 2
    2 0
    0 0
    

    Sample Output

    1
    1
    2

    题解:题意就是让机器人走完所有的路,有向边,问最少需要放几个机器人。
    这个很明显是二分图的最小路径覆盖,求一个传递闭包,这个复杂度十分大
    至少也是N^3级别了,然后就是节点数-最大匹配数就ok了。
     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<cmath>
     4 #include<cstring>
     5 #include<iostream>
     6 using namespace std;
     7 const int N=507,M=5007;
     8 
     9 int n,m;
    10 int cnt,head[N],next[N*N],rea[N*N];
    11 int map[N][N],flag[N],ly[N];
    12 
    13 void add(int u,int v){next[++cnt]=head[u],head[u]=cnt,rea[cnt]=v;}
    14 bool dfs(int u)
    15 {
    16     for (int i=head[u];i!=-1;i=next[i])
    17     {
    18         int v=rea[i];
    19         if (flag[v]) continue;
    20         flag[v]=true;
    21         if (!ly[v]||(dfs(ly[v])))
    22         {
    23             ly[v]=u;
    24             return 1;
    25         }
    26     }
    27     return 0;
    28 }
    29 int main()
    30 {
    31     while(~scanf("%d%d",&n,&m)&&(n|m))
    32     {
    33         cnt=0;
    34         memset(head,-1,sizeof(head));
    35         memset(map,0,sizeof(map));
    36         int x,y;
    37         for (int i=1;i<=m;i++)
    38         {
    39             scanf("%d%d",&x,&y);
    40             map[x][y]=1;
    41         }
    42         for (int k=1;k<=n;k++)
    43             for (int i=1;i<=n;i++)
    44                 for (int j=1;j<=n;j++)
    45                     if (map[i][k]&&map[k][j]) map[i][j]=1;
    46         for (int i=1;i<=n;i++)
    47             for (int j=1;j<=n;j++)
    48                 if (map[i][j]) add(i,j);             
    49         memset(ly,0,sizeof(ly));
    50         int ans=0;
    51         for (int i=1;i<=n;i++)
    52         {
    53             memset(flag,0,sizeof(flag));
    54             ans+=dfs(i);
    55         }
    56         ans=n-ans;
    57         printf("%d
    ",ans);
    58     }
    59 }

    非要搞个前向星,然后空间还开小了。

    
    
  • 相关阅读:
    ibatisnet系列
    jQuery弹出层演示
    winform中datagridview的用法
    ASP.net:截取固定长度字符串显示在页面,多余部分显示为省略号
    hdu 4507 恨7不成妻(求l,r中与7不相关数字的平方和)
    hdu 2089 数位dp
    uestc 1307 统计数位之间相差不小于2的数的个数
    Spoj 2319 数位统计(0,1, 2^k1 这些数分成M份)
    zoj 3416 统计平衡数个数
    数位统计 sgu 390 <浅谈数位类问题>
  • 原文地址:https://www.cnblogs.com/fengzhiyuan/p/7630592.html
Copyright © 2011-2022 走看看