zoukankan      html  css  js  c++  java
  • Hdu 1151

    Air Raid

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


    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

     Accepted Code:

     1 /*************************************************************************
     2     > File Name: 1151.cpp
     3     > Author: Stomach_ache
     4     > Mail: sudaweitong@gmail.com
     5     > Created Time: 2014年07月14日 星期一 12时51分49秒
     6     > Propose: 
     7  ************************************************************************/
     8 
     9 #include <cmath>
    10 #include <string>
    11 #include <vector>
    12 #include <cstdio>
    13 #include <fstream>
    14 #include <cstring>
    15 #include <iostream>
    16 #include <algorithm>
    17 using namespace std;
    18 
    19 int t, n, m;
    20 int cx[122], cy[122], mark[122];
    21 int map[122][122];
    22 
    23 int 
    24 path(int x) {
    25       for (int i = 1; i <= n; i++) {
    26           if (map[x][i] && !mark[i]) {
    27               mark[i] = 1;
    28             if (cy[i] == -1 || path(cy[i])) {
    29                   cx[x] = i;
    30                 cy[i] = x;
    31                 return 1;
    32             }
    33         }
    34     }
    35     return 0;
    36 }
    37 
    38 int
    39 MaxMatch() {
    40       memset(cx, -1, sizeof(cx));
    41       memset(cy, -1, sizeof(cy));
    42     int res = 0;
    43     for (int i = 1; i <= n; i++) {
    44         if (cx[i] == -1) {
    45               memset(mark, 0, sizeof(mark));
    46             res += path(i);
    47         }
    48     }
    49     return res;
    50 }
    51 
    52 int
    53 main(void) {
    54       scanf("%d", &t);
    55     while (t--) {
    56           scanf("%d %d", &n, &m);
    57         memset(map, 0, sizeof(map));
    58         for (int i = 0; i < m; i++) {
    59               int x, y;
    60             scanf("%d %d", &x, &y);
    61             map[x][y] = 1;
    62         }
    63         printf("%d
    ", n - MaxMatch());
    64     }
    65 
    66     return 0;
    67 }
  • 相关阅读:
    TensorFlow 官方文档中文版 --技术文档
    借助离散数学解决“哈弗大学智商测试”一题 --编程算法
    Python3文件操作1 --Python3
    ThinkPHP5.0完全开发手册 --技术文档
    JSON和Serialize数据格式的对比
    JSON格式简介
    Github的简易操作
    Python3之JSON数据解析实例:新闻头条 --Python3
    MySql常用函数 --MySql
    Git简易教程
  • 原文地址:https://www.cnblogs.com/Stomach-ache/p/3843701.html
Copyright © 2011-2022 走看看