hdoj--1151--Air Raid(最大独立集)
2016-02-01 13:21
459 查看
Air Raid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4321 Accepted Submission(s): 2874
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 4 3 3 4 1 3 2 3 3 3 1 3 1 2 2 3
[align=left]Sample Output[/align]
2 1
[align=left]Source[/align]
Asia 2002, Dhaka (Bengal)
[align=left]Recommend[/align]
Ignatius.L | We have carefully selected several similar problems for you: 1281 1507 1528 1498 1054
#include<stdio.h> #include<math.h> #include<vector> #include<string.h> #include<algorithm> using namespace std; vector<int>map[200]; int used[200],pipei[200]; int find(int x) { for(int i=0;i<map[x].size();i++) { int y=map[x][i]; if(!used[y]) { used[y]=1; if(!pipei[y]||find(pipei[y])) { pipei[y]=x; return 1; } } } return 0; } int main() { int t; scanf("%d",&t); while(t--) { int n,m; scanf("%d%d",&n,&m); memset(pipei,0,sizeof(pipei)); for(int i=1;i<=n;i++) map[i].clear(); for(int i=0;i<m;i++) { int x,y; scanf("%d%d",&x,&y); map[x].push_back(y); } int sum=0; for(int i=1;i<=n;i++) { memset(used,0,sizeof(used)); sum+=find(i); } printf("%d\n",n-sum); } return 0; }
相关文章推荐
- Starting httpd: httpd: apr_sockaddr_info_get() failed
- 【转】UltraISO制作U盘启动盘安装Win7/9/10系统攻略
- 【Xamain 跨平台机制原理剖析】
- tools:context=".MainActivity的作用
- rails s 命令不起作用
- 出现( linker command failed with exit code 1)错误总结
- [INS-41112] Specified network interface doesnt maintain connectivi
- Rails 使用 Google Analytics 示例
- [Regular Expressions] Find Plain Text Patterns
- A*启发式搜索算法详解 人工智能
- the usage of activity_main.xml
- 获取sina,baidu,google财经历史和实时股票数据接口
- Aircrack-ng——Tutorial
- Airodump-ng——Description
- kali 2.0 — aircrack-ng dictionary — wordlists
- airbase-ng stops working after a while--wifi热点只能连接20秒左右
- adb shell里面ls提示opendir failed, Permission denied
- 获取sina,baidu,google财经历史和实时股票数据接口
- MyBatis批量操作报错:Parameter 'xxxList' not found. Available parameters are [list]
- Windows安装RaibbitMQ服务器