最短路径
爱上键盘的小哥哥
这个作者很懒,什么都没留下…
展开
-
Til the Cows Come Home (Dijkstra)
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get b原创 2017-08-01 09:28:34 · 373 阅读 · 0 评论 -
Problem D. Dwarf Tower(最短路)
#include<stdio.h>#include<string.h>#include<vector>#include<queue>using namespace std;const int N = 100005;struct node{ int x,y; node(){}; node(int xx,int yy){ x=xx;...原创 2018-04-09 19:51:33 · 157 阅读 · 0 评论 -
Fight Against Traffic(思维+Dijkstra)
Little town Nsk consists of n junctions connected by m bidirectional roads. Each road connects two distinct junctions and no two roads connect the same pair of junctions. It is possible to get from an...原创 2018-04-02 21:07:44 · 588 阅读 · 0 评论 -
Til the Cows Come Home POJ - 2387 (最短路)
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she w...原创 2018-04-30 19:20:47 · 197 阅读 · 0 评论 -
Frogger POJ - 2253(可达路径中的最大值)
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 full of ...原创 2018-04-30 20:35:28 · 180 阅读 · 0 评论 -
Heavy Transportation POJ - 1797 (可达路径的最小值)
Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way fro...原创 2018-04-30 21:15:03 · 211 阅读 · 0 评论 -
Integer Intervals POJ - 1716(贪心 or 差分约束)
An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b.Write a program that: finds the minimal number of elements in a set containing at least tw...原创 2018-07-22 10:32:07 · 200 阅读 · 0 评论 -
Intervals POJ - 1201 (差分约束)
You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:reads the number of intervals, their end points and integers c1, ..., cn from the standard input,c...原创 2018-07-22 15:29:41 · 181 阅读 · 0 评论 -
Layout POJ - 3169(差分约束+SPFA)
Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows are s...原创 2018-07-22 16:48:47 · 342 阅读 · 1 评论 -
Candies POJ - 3159 (差分约束+SPFA)
During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the...原创 2018-07-22 19:46:28 · 130 阅读 · 0 评论 -
B - Atm (tarjan缩点 + SPFA最长路)
Siruseri 城中的道路都是单向的。不同的道路由路口连接。按照法律的规定, 在每个路口都设立了一个 Siruseri 银行的 ATM 取款机。令人奇怪的是,Siruseri 的酒吧也都设在路口,虽然并不是每个路口都设有酒吧。Banditji 计划实施 Siruseri 有史以来最惊天动地的 ATM 抢劫。他将从市中心 出发,沿着单向道路行驶,抢劫所有他途径的 ATM 机,最终他将在...原创 2018-08-12 11:18:49 · 180 阅读 · 0 评论 -
transaction transaction transaction HDU - 6201 (无向图最长路SPFA)
Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named "the Man Who Changed China". Of course, Kel...原创 2018-08-03 16:08:55 · 270 阅读 · 0 评论 -
直捣黄龙(Dijkstra+map+打印路径)
本题是一部战争大片 —— 你需要从己方大本营出发,一路攻城略地杀到敌方大本营。首先时间就是生命,所以你必须选择合适的路径,以最快的速度占领敌方大本营。当这样的路径不唯一时,要求选择可以沿途解放最多城镇的路径。若这样的路径也不唯一,则选择可以有效杀伤最多敌军的路径。输入格式:输入第一行给出2个正整数N(2 <= N <= 200,城镇总数)和K(城镇间道路条数),以及己方大本营和敌方...原创 2018-03-12 14:56:31 · 396 阅读 · 0 评论 -
紧急救援(Dijkstra+打印路径)
作为一个城市的应急救援队伍的负责人,你有一张特殊的全国地图。在地图上显示有多个分散的城市和一些连接城市的快速道路。每个城市的救援队数量和每一条连接两个城市的快速道路长度都标在地图上。当其他城市有紧急求助电话给你的时候,你的任务是带领你的救援队尽快赶往事发地,同时,一路上召集尽可能多的救援队。输入格式:输入第一行给出4个正整数N、M、S、D,其中N(2<=N<=500)是城市的个数,...原创 2018-03-11 10:26:00 · 174 阅读 · 0 评论 -
求最短路之Bellman-Ford算法
算法思路:Bellman-Ford算法是通过边进行松弛,即枚举每一条边,然后比较源点到边的终点的估计最短路径估计值和源点到该边的起点的估计最短路径估计值加上边长复杂度:O(nm) n为点数,m为边数#include<bits/stdc++.h>#define Inf 0x3f3f3f3fusing namespace std;const int N = 1005;struct ...原创 2018-03-09 16:13:51 · 293 阅读 · 0 评论 -
HDU Today (Dijkstra)
经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在什么地方下车(其实徐总自己有车,却一定原创 2017-08-02 14:07:43 · 185 阅读 · 0 评论 -
最短路径问题(Dijkstra)
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input 输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。(1Output 输出 一行有两个数,原创 2017-08-02 16:51:29 · 380 阅读 · 0 评论 -
Silver Cow Party (Dijkstra)
One 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) unidirectional (one-way r原创 2017-08-02 18:05:54 · 405 阅读 · 0 评论 -
迷宫问题
定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。 Input 一个5 ×原创 2017-07-25 15:42:35 · 392 阅读 · 0 评论 -
hud 一个人的旅行 (Dijkstra)
虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大段时间,可不能浪费啊,一定要给自己好好的放个假原创 2017-08-03 13:33:33 · 323 阅读 · 0 评论 -
How Many Maos Does the Guanxi Worth (暴力枚举+Dijkstra)
"Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but also can be built on money. So Chinese often say "I don't have one ma原创 2017-08-05 13:42:02 · 261 阅读 · 0 评论 -
六度分离 (Floyd-Warshall)
1967年,美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说,大意是说,任何2个素不相识的人中间最多只隔着6个人,即只用6个人就可以将他们联系在一起,因此他的理论也被称为“六度分离”理论(six degrees of separation)。虽然米尔格兰姆的理论屡屡应验,一直也有很多社会学家对其兴趣浓厚,但是在30多年的时间原创 2017-08-06 17:15:30 · 339 阅读 · 0 评论 -
迷宫游戏 (Dijkstra)
你来到一个迷宫前。该迷宫由若干个房间组成,每个房间都有一个得分,第一次进入这个房间,你就可以得到这个分数。还有若干双向道路连结这些房间,你沿着这些道路从一个房间走到另外一个房间需要一些时间。游戏规定了你的起点和终点房间,你首要目标是从起点尽快到达终点,在满足首要目标的前提下,使得你的得分总和尽可能大。现在问题来了,给定房间、道路、分数、起点和终点等全部信息,你能计算在尽快离开迷宫的前提下,你的最大原创 2017-08-06 17:10:38 · 572 阅读 · 0 评论 -
最短路
Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗? Input输入包括多组数据。每组数据第一行是两个整数N、M(N输入保证至少存在1条商店到赛场的路线。 O原创 2017-12-28 23:06:25 · 179 阅读 · 0 评论 -
938D. Buy a Ticket (SPFA)
Musicians of a popular band "Flayer" have announced that they are going to "make their exit" with a world tour. Of course, they will visit Berland as well.There are n cities in Berland. People can tra...原创 2018-02-20 11:51:00 · 611 阅读 · 1 评论 -
ACM-ICPC 2018 南京赛区网络预赛 Magical Girl Haze(分层图最短路)
There are NNN cities in the country, and MMM directional roads from uuu to v(1≤u,v≤n)v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance cic_ici. Haze is a Magical Girl that lives in City 111, she...原创 2018-09-03 17:01:28 · 331 阅读 · 0 评论