最短路
Wang_SF2015
这个作者很懒,什么都没留下…
展开
-
文章标题 csu1333 :Funny Car Racing(最短路 spfa)
Funny Car RacingDescriptionThere is a funny car racing in a city with n junctions and m directed roads. The funny part is: each road is open and closed periodically. Each road is associate with two int原创 2016-09-03 23:23:14 · 602 阅读 · 0 评论 -
文章标题 HDU 1217 : Arbitrage(最短路--Floyd+map)
ArbitrageDescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dol原创 2016-10-30 21:26:40 · 396 阅读 · 0 评论 -
文章标题 POJ 2253 : Frogger(最短路--Floyd)
FroggerDescription Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and fu原创 2016-11-13 22:20:28 · 340 阅读 · 0 评论 -
文章标题 POJ 1860 : Currency Exchange(最短路--spfa)
Currency ExchangeDescription Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only wit原创 2016-11-13 22:49:34 · 308 阅读 · 0 评论 -
文章标题 CoderForces 450D : Jzzhu and Cities(最短路---spfa)
Jzzhu and CitiesDescription Jzzhu is the president of country A. There are n cities numbered from 1 to n in his country. City 1 is the capital of A. Also there are m roads connecting the cities. One c原创 2016-11-27 17:53:25 · 437 阅读 · 0 评论 -
文章标题 POJ 3268 : Silver Cow Party (最短路--spfa)
Silver Cow PartyOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectio原创 2017-01-23 17:19:00 · 279 阅读 · 0 评论 -
文章标题 UVA 11374 : Airport Express(最短路--dijkstra)
Airport Express题意:有两种机票,一种经济机票,另一种商务几票,商务机票比较快,但比较贵。现在要从s地点到达e地点,然后期间最多只能用一张商务几票,第一行将路线的每个站输出来,第二行如果有使用商务机票,将机票的起始地点输出来,没有使用就输出Ticket Not Used,第三行输出最短的时间 分析:这是一道以dijkstra为基础的题目,首先可以求出只有经济机票时起始点s到达其他顶点原创 2017-03-11 15:13:10 · 250 阅读 · 0 评论 -
文章标题 CSU 1817 : Bones’s Battery(Floyd+二分)
1817: Bones’s Battery1817: Bones’s Battery 题意:有n个点m每条边的无向带权图,从点ui到vi需要花费电量di,要求对任一起点s到终点e,都能通过充电并且充电的次数不超过k次(在任何一个点都可以充满电)互相到达,问电池的容量最小是多少。 分析:这是我遇到的第一道二分答案,所以一开始不知道怎么做,看了标程后恍然大悟。。 首先,已经明确二分答案了,原创 2017-03-30 00:12:35 · 340 阅读 · 0 评论 -
文章标题 HDU 6166 : Senior Pan(二进制+dijkstra)
Senior Pan题目链接 题意:有n个点,m条边的有向图,然后从中拿出k个点,然后要我们求出这k个点中距离最短的两个点。 分析:巧妙的用了二进制的思想,对于一个点上的一个二进制位,我们可以知道,不是1就是0,那么我们就可以通过判断这个二进制位是否是1来将这k个点的分成两个集合,由于n的大小只有1e5,所以最多只需要枚举20个二进制为, 然后就是当把k个点分成两个集合后,就是求两个集合之间的最原创 2017-08-23 09:53:11 · 386 阅读 · 0 评论