图论
文章平均质量分 85
Hashmat
这个作者很懒,什么都没留下…
展开
-
(最大流) POJ 1698 Alice's Chance
Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1613 Accepted: 740DescriptionAlice, a charming girl, have been dreaming of being a movie star for long. Her chances will come now, for several filmmaking companies invite her to play t原创 2010-09-14 14:56:00 · 723 阅读 · 0 评论 -
二分图匹配(简单题)POJ 1274 The Perfect Stall
The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8898 Accepted: 4136DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the原创 2010-09-05 19:46:00 · 718 阅读 · 0 评论 -
(最小费用) POJ 2135 Farm Tour
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3424 Accepted: 1065DescriptionWhen FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 To show off原创 2010-09-20 16:21:00 · 683 阅读 · 0 评论 -
(消一个负圈) poj 2175 Evacuation Plan
Evacuation PlanTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 968 Accepted: 236 Special Judge<br />DescriptionThe City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in ca原创 2010-09-17 10:45:00 · 1360 阅读 · 0 评论 -
二分图完备匹配(最小费用 || KM) poj 2195 GoingHome
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9225 Accepted: 4753DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adja原创 2010-09-05 20:20:00 · 2198 阅读 · 0 评论 -
(Bellman_ford+队列 求环) poj 1860 Currency Exchange
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7392 Accepted: 2357<br />DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs ex原创 2010-09-14 15:03:00 · 934 阅读 · 0 评论 -
(最大流-简单题) poj 1273 Drainage Ditches
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24043 Accepted: 8706<br />DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for原创 2010-09-14 15:00:00 · 652 阅读 · 0 评论 -
二分图(bfs+匈牙利算法) POJ 1469 course
COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8076 Accepted: 3208DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a原创 2010-09-05 20:10:00 · 1224 阅读 · 0 评论 -
(最大流) poj 1459 Power Network
Power NetworkTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 11326Accepted: 6220DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied wit原创 2010-09-15 22:09:00 · 1170 阅读 · 0 评论 -
(匈牙利算法) 小狗散步
<br />小狗散步<br />Grant喜欢带着他的小狗Pandog散步。Grant以一定的速度沿着固定路线走,该路线可能自交。Pandog喜欢游览沿途的景点,不过会在给定的N个点和主人相遇。小狗和主人同时从(X1,Y1)点出发,并同时在(Xn,Yn)点汇合。小狗的速度最快是Grant的两倍。当主人从一个点以直线走向另一个点时,Pandog跑向一个它感兴趣的景点。Pandog每次与主人相遇之前最多只去一个景点。<br />你现在的任务是:为Pandog寻找一条路线(有可能与主人的路线部分相同),使它能原创 2010-09-14 15:06:00 · 1271 阅读 · 0 评论 -
(根据物品多次建图+最小费用最大流) poj 2516 Minimum Cost
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7054 Accepted: 2305<br />DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which st原创 2010-09-23 00:26:00 · 1021 阅读 · 1 评论