----最短路
文章平均质量分 85
_Occult_
物語が始まった
展开
-
HDU 3268 Columbus’s bargain
On the evening of 3 August 1492, Christopher Columbus departed from Palos de la Frontera with a few ships, starting a serious of voyages of finding a new route to India. As you know, just in those voy原创 2015-02-18 14:45:42 · 612 阅读 · 0 评论 -
CodeForces 144D Missile Silos
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city原创 2017-03-14 20:15:39 · 483 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1131 Subway Map (30)
1131. Subway Map (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIn the big cities, the subway systems always lo原创 2017-03-22 15:16:53 · 1330 阅读 · 0 评论 -
HUST 1408 公交系统
因为中国人口众多,公共交通就显得很重要. 在传统城市公共交通系统中,公交车是一种很重要的工具。甚至现在还扮演了一种极其重要的角色。X市的公交系统显得很独特。不像别的城市,该市公交系统是基于两站间的距离来计费的。下表描述了两站之间距离与费用的关系: 距离费用0C1L1C2L2原创 2016-12-23 11:36:58 · 314 阅读 · 0 评论 -
HDU 5669 Road
Road Accepts: 4 Submissions: 61 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述\ \ \ \ TA想要让别人把他叫做Taishenle [Au]gust.\ \ \ \原创 2016-12-05 19:35:37 · 464 阅读 · 0 评论 -
HYSBZ 2763 飞行路线
DescriptionAlice和Bob现在要乘飞机旅行,他们选择了一家相对便宜的航空公司。该航空公司一共在n个城市设有业务,设这些城市分别标记为0到n-1,一共有m种航线,每种航线连接两个城市,并且航线有一定的价格。Alice和Bob现在要从一个城市沿着航线到达另一个城市,途中可以进行转机。航空公司对他们这次旅行也推出优惠,他们可以免费在最多k种航线上搭乘飞机。那么Alice和Bob这次原创 2016-12-04 14:12:40 · 428 阅读 · 0 评论 -
CSU 1806 Toll
Description In ICPCCamp, there are n cities and m unidirectional roads between cities. The i-th road goes from the ai-th city to the bi-th city. For each pair of cities u and v, there is at most原创 2016-09-05 19:52:38 · 616 阅读 · 0 评论 -
CSU 1808 地铁
Description Bobo 居住在大城市 ICPCCamp。ICPCCamp 有 n 个地铁站,用 1,2,…,n 编号。 m 段双向的地铁线路连接 n 个地铁站,其中第 i 段地铁属于 ci 号线,位于站 ai,bi 之间,往返均需要花费 ti 分钟(即从 ai 到 bi 需要 ti 分钟,从 bi 到 ai 也需要 ti分钟)。众所周知,换乘线路很麻烦。如原创 2016-09-04 14:14:52 · 769 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1003 Emergency (25)
1003. Emergency (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAs an emergency rescue team leader of a city, yo原创 2016-03-02 19:36:27 · 737 阅读 · 2 评论 -
HDU 5876 Sparse Graph
Problem DescriptionIn graph theory, the complement of a graph G is a graph H on the same vertices such that two distinct vertices of H are adjacent if and only if they are not adjacent i原创 2016-09-11 21:47:11 · 360 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1111 Online Map (30)
1111. Online Map (30)时间限制300 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueInput our current position and a destination, a原创 2016-03-26 17:28:28 · 1031 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1018 Public Bike Management (30)
1018. Public Bike Management (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThere is a public bike service in H原创 2016-03-04 19:57:59 · 911 阅读 · 0 评论 -
HDU 4725 The Shortest Path in Nya Graph
This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this paragraph, just原创 2017-04-04 21:07:05 · 318 阅读 · 0 评论