图
穆晨
这个作者很懒,什么都没留下…
展开
-
06-图6. 公路村村通(30)
06-图6. 公路村村通(30)时间限制 400 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 现有村落间道路的统计数据表中,列出了有可能建设成标准公路的若干条道路的成本,求使每个村落都有公路连通所需要的最低成本。输入格式说明:输入数据包括城镇数目正整数N(<=1000)和候选道路数目M(<=3N);随后的M行对应M条道路,每行给出3个正整原创 2015-06-26 22:11:18 · 580 阅读 · 0 评论 -
POJ1094 拓扑排序
Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31001 Accepted: 10766 DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-t原创 2015-12-18 21:40:20 · 271 阅读 · 0 评论 -
POJ 1789 Kruskal
Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22819 Accepted: 8849 DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vege原创 2015-12-18 21:45:28 · 320 阅读 · 0 评论 -
POJ2485 Kruskal
Highways Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26642 Accepted: 12190 DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways原创 2015-12-18 21:49:38 · 246 阅读 · 0 评论 -
POJ1258 Kruskal
Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 47203 Accepted: 19526 DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring inter原创 2015-12-18 21:54:36 · 261 阅读 · 0 评论 -
POJ3026 BFS+kruskal
Borg Maze Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11201 Accepted: 3683 DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the gal原创 2015-12-18 22:02:21 · 261 阅读 · 0 评论 -
POJ3041 二分图最大匹配
Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18385 Accepted: 10019 DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N原创 2015-12-18 22:14:36 · 268 阅读 · 0 评论 -
POJ3020 二分图最大匹配
Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7873 Accepted: 3908 DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth gener原创 2015-12-18 22:25:02 · 322 阅读 · 0 评论 -
POJ 1201 差分约束系统
题目Intervals Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 24326 Accepted: 9247 DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, …, cn. Writ原创 2016-04-30 00:01:05 · 300 阅读 · 0 评论 -
POJ 2983 差分约束系统
题目Is the Information Reliable? Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 12490 Accepted: 3930 DescriptionThe galaxy war between the Empire Draco and the Commonwealth of原创 2016-04-30 00:25:34 · 301 阅读 · 0 评论 -
POJ 3159 差分约束系统+spfa
题目Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 27843 Accepted: 7674 DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally th原创 2016-04-30 00:33:22 · 314 阅读 · 0 评论 -
POJ2240 Floyd
Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18752 Accepted: 7929 DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a cur原创 2015-12-18 21:30:02 · 229 阅读 · 0 评论 -
POJ1125 dijkstra求任意两点距离
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 32240 Accepted: 17715 DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develo原创 2015-12-18 21:20:03 · 480 阅读 · 0 评论 -
06-图5. 旅游规划
有了一张自驾旅游路线图,你会知道城市间的高速公路长度、以及该公路要收取的过路费。现在需要你写一个程序,帮助前来咨询的游客找一条出发地和目的地之间的最短路径。如果有若干条路径都是最短的,那么需要输出最便宜的一条路径。输入格式说明:输入说明:输入数据的第1行给出4个正整数N、M、S、D,其中N(2<=N<=500)是城市的个数,顺便假设城市的编号为0~(N-1);M是高速公路的条数;S是出发地的城市编号原创 2015-06-12 17:54:15 · 1874 阅读 · 0 评论 -
06-图2. Saving James Bond - Easy Version
This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the world’s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land a原创 2015-05-21 01:27:14 · 837 阅读 · 0 评论 -
POJ 1860 Bellman-frod判断负权回路
Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 24022 Accepted: 8718 DescriptionSeveral currency exchange points are working in our city. Let us suppose that each poin原创 2015-12-12 18:40:37 · 320 阅读 · 0 评论 -
POJ 1062 迪杰斯特拉
昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42271 Accepted: 12369 Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:”嗯,原创 2015-12-12 23:41:58 · 264 阅读 · 0 评论 -
06-图1. List Components
For a given undirected graph with N vertices and E edges, please list all the connected components by both DFS and BFS. Assume that all the vertices are numbered from 0 to N-1. While searching, assume原创 2015-05-20 17:39:52 · 352 阅读 · 0 评论 -
1003. Emergency (25)
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the le原创 2015-06-16 10:30:52 · 1165 阅读 · 0 评论 -
POJ 3259 Bellman-frod
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 38525 Accepted: 14179 DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wo原创 2015-12-12 18:53:48 · 190 阅读 · 0 评论 -
06-图7. How Long Does It Take (25)
Given the relations of all the activities of a project, you are supposed to find the earliest completion time of the project.Input Specification:Each input file contains one test case. Each case starts原创 2015-06-30 11:22:32 · 495 阅读 · 0 评论 -
POJ 2253 Dijkstra变形
Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32024 Accepted: 10318 DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is原创 2015-12-13 00:28:03 · 258 阅读 · 0 评论 -
二分图最大匹配的König定理及其证明
二分图最大匹配的König定理及其证明如果你看不清楚第二个字母,下面有一个大号字体版本:二分图最大匹配的König定理及其证明本文将是这一系列里最短的一篇,因为我只打算把König定理证了,其它的废话一概没有。以下五个问题我可能会在以后的文章里说,如果你现在很想知道的话,网上去找找答案:1. 什么是二分图;2. 什么是二分图的匹配;3. 什么是匈牙利算法;(http://www.matri转载 2015-12-17 21:53:33 · 278 阅读 · 0 评论 -
POJ 1275 差分约束系统+二分
题目Cashier Employment Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7692 Accepted: 2906 DescriptionA supermarket in Tehran is open 24 hours a day every day and needs a number of原创 2016-04-30 00:46:46 · 541 阅读 · 0 评论