zoukankan      html  css  js  c++  java
  • HDU1151 Air Raid —— 最小路径覆盖

    题目链接:https://vjudge.net/problem/HDU-1151

    Air Raid

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5630    Accepted Submission(s): 3785


    Problem Description
    Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never reach the same intersection i.e. the town's streets form no cycles.

    With these assumptions your task is to write a program that finds the minimum number of paratroopers that can descend on the town and visit all the intersections of this town in such a way that more than one paratrooper visits no intersection. Each paratrooper lands at an intersection and can visit other intersections following the town streets. There are no restrictions about the starting intersection for each paratrooper.
     
    Input
    Your program should read sets of data. The first line of the input file contains the number of the data sets. Each data set specifies the structure of a town and has the format:

    no_of_intersections
    no_of_streets
    S1 E1
    S2 E2
    ......
    Sno_of_streets Eno_of_streets

    The first line of each data set contains a positive integer no_of_intersections (greater than 0 and less or equal to 120), which is the number of intersections in the town. The second line contains a positive integer no_of_streets, which is the number of streets in the town. The next no_of_streets lines, one for each street in the town, are randomly ordered and represent the town's streets. The line corresponding to street k (k <= no_of_streets) consists of two positive integers, separated by one blank: Sk (1 <= Sk <= no_of_intersections) - the number of the intersection that is the start of the street, and Ek (1 <= Ek <= no_of_intersections) - the number of the intersection that is the end of the street. Intersections are represented by integers from 1 to no_of_intersections.

    There are no blank lines between consecutive sets of data. Input data are correct.
     
    Output
    The result of the program is on standard output. For each input data set the program prints on a single line, starting from the beginning of the line, one integer: the minimum number of paratroopers required to visit all the intersections in the town.
     
    Sample Input
    2 4 3 3 4 1 3 2 3 3 3 1 3 1 2 2 3
     
    Sample Output
    2 1
     
    Source
     
    Recommend
    Ignatius.L

    题解:

    单纯的求最小路径覆盖。最小路径覆盖 = 结点数 - 最大匹配数

    代码如下:

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cstdlib>
     5 #include <string>
     6 #include <vector>
     7 #include <map>
     8 #include <set>
     9 #include <queue>
    10 #include <sstream>
    11 #include <algorithm>
    12 using namespace std;
    13 const int INF = 2e9;
    14 const int MOD = 1e9+7;
    15 const int MAXN = 120+10;
    16 
    17 int n;
    18 int M[MAXN][MAXN], link[MAXN];
    19 bool vis[MAXN];
    20 
    21 bool dfs(int u)
    22 {
    23     for(int i = 1; i<=n; i++)
    24     if(M[u][i] && !vis[i])
    25     {
    26         vis[i] = true;
    27         if(link[i]==-1 || dfs(link[i]))
    28         {
    29             link[i] = u;
    30             return true;
    31         }
    32     }
    33     return false;
    34 }
    35 
    36 int hungary()
    37 {
    38     int ret = 0;
    39     memset(link, -1, sizeof(link));
    40     for(int i = 1; i<=n; i++)
    41     {
    42         memset(vis, 0, sizeof(vis));
    43         if(dfs(i)) ret++;
    44     }
    45     return ret;
    46 }
    47 
    48 int main()
    49 {
    50     int T, m;
    51     scanf("%d", &T);
    52     while(T--)
    53     {
    54         scanf("%d%d", &n, &m);
    55         memset(M, false, sizeof(M));
    56         for(int i = 1; i<=m; i++)
    57         {
    58             int u, v;
    59             scanf("%d%d", &u, &v);
    60             M[u][v] = true;
    61         }
    62 
    63         int cnt = hungary();
    64         printf("%d
    ", n-cnt);
    65     }
    66 }
    View Code
  • 相关阅读:
    emberjs初学记要
    自我的一点介绍(七夕礼物)
    JavaScript数据类型
    Vue+Webpack项目配置
    Git知识点整合
    Log4j简单配置解析
    如何明智地向程序员提问
    Navicat连接mysql报错1251
    多表查询sql语句
    PLSQL面向对象
  • 原文地址:https://www.cnblogs.com/DOLFAMINGO/p/7818413.html
Copyright © 2011-2022 走看看