最短路
文章平均质量分 57
tomjobs
别慌,慌也没用
展开
-
Codeforces-1496 F. BFS Trees(生成树,最短路)
We define a spanning tree of a graph to be a BFS tree rooted at vertex ???? if and only if for every node ???? the shortest distance between ???? and ???? in the graph is equal to the shortest distance between ???? and ???? in the spanning tree.Given a gr原创 2021-03-13 13:25:29 · 280 阅读 · 0 评论 -
2021年度训练联盟热身训练赛第一场 H. On Average They‘re Purple(最短路,染色)
题意:无向图,你可以给边染色,如果走过的相邻两条边颜色不同,那么权值加一。求一种染色方案,起点终点所有路径中染色得到权值的最小值最大,输出权值。思路:按照起点到其他点的最短距离分组,最短距离为1的组,权值一定为0,最短距离为2的组,一定有一种染色方法使得到这些点权值至少为1,最短距离为3的组,只有在距离2的基础上改变颜色就可以使得其权值至少为2。所以只要求出起点到终点最短距离即可。#include <cstdio>#include <cstring>#include .原创 2021-03-11 10:16:35 · 266 阅读 · 0 评论 -
Codeforces-1486 E. Paired Payment(多维最短路)
题意:无向图,但是一次至少走两步,权值为两个边边权和的平方。求1到其他每个点的最短距离。思路:直观的想法是重构图,将所有的两步变成一个边。但是这样很容易想到,如果某些点存在很多出边,就可以构成很多的两步边,这样复杂度不可接受。观察可知,这里的边权很小,很适合作为一维状态。因为要两条边才能计算一次距离,所以定义dis[x][w][odd]dis[x][w][odd]dis[x][w][odd]代表起点走到xxx,上一条边权值为www,已经走过边数的是否为奇数oddoddodd。这样当从奇数步数转移.原创 2021-02-19 22:37:40 · 575 阅读 · 0 评论 -
Codeforces-1473 E. Minimum Path(分层图(多维)最短路)
题意:一条路径的花费为求1点到其他所有点路径的最小花费。思路:每个路径可以分出两种操作:减掉一条边,加上一条边。那么定义dis[i][0/1][0/1]dis[i][0/1][0/1]dis[i][0/1][0/1]代表1到iii路径的最小花费,以及包括第一次操作的使用情况,第二次操作的使用情况。然后就dijdijdij转移就好了。#include <cstdio>#include <cstring>#include <algorithm>#inclu原创 2021-01-16 20:08:39 · 292 阅读 · 0 评论 -
LeetCode 407. 接雨水 II(优先队列+BFS,类Dijkstra)
给你一个 m x n 的矩阵,其中的值均为非负整数,代表二维高度图每个单元的高度,请计算图中形状最多能接多少体积的雨水。示例:给出如下 3x6 的高度图:[[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]]返回 4 。如上图所示,这是下雨前的高度图[[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]] 的状态。下雨后,雨水将会被存储在这些方块中。总的接雨水量是4。提示:1 <= m, n <= 110原创 2021-01-10 22:19:09 · 287 阅读 · 0 评论 -
2020江苏省赛I - Intersections Gym - 102875I(最短路)
题意:如果当前时间是timtimtim,那么如果timmod (a[x][y]+b[x][y])<a[x][y]tim \mod (a[x][y]+b[x][y])<a[x][y]timmod(a[x][y]+b[x][y])<a[x][y],这个点可以向(x+1,y),(x−1,y)(x+1,y),(x-1,y)(x+1,y),(x−1,y)走,否则可以向(x,y−1),(x,y+1)(x,y-1),(x,y+1)(x,y−1),(x,y+1)走。问(sx,sy)(sx,sy)(s.原创 2020-12-02 13:31:35 · 540 阅读 · 0 评论 -
CCPC2020威海 B Labyrinth(关键点最短路)
Due to the challenging problems, some of the contestants decide to escape from this contest. However, to prevent this from happening, the EVIL problem setters made a labyrinth at the stadium’s exit. The labyrinth is made of an n×m grid, on which lie the en原创 2020-10-31 21:50:36 · 342 阅读 · 0 评论 -
Codeforces1433 G. Reducing Delivery Cost(最短路)
You are a mayor of Berlyatov. There are ???? districts and ???? two-way roads between them. The ????-th road connects districts ???????? and ????????. The cost of travelling along this road is ????????. There is some path between each pair of districts, so原创 2020-10-23 18:22:27 · 274 阅读 · 0 评论 -
D - Returning Home CodeForces - 1422D(最短路建图)
Yura has been walking for some time already and is planning to return home. He needs to get home as fast as possible. To do this, Yura can use the instant-movement locations around the city.Let’s represent the city as an area of n×n square blocks. Yura ne原创 2020-10-09 19:51:07 · 221 阅读 · 0 评论 -
2020杭电多校第四场 Deliver the Cake(二维最短路)
Problem DescriptionIt is Zhang3’s birthday! Zhang3 has bought a birthday cake and now it’s time to take it home.There are n villages, labeled 1,2,…,n. There are m bidirectional roads, the ith of which connects village ai, bi and it is di meter(s) long.T原创 2020-08-06 00:01:24 · 291 阅读 · 0 评论 -
2020杭电多校第三场 Tokitsukaze and Rescue(最短路,随机数据)
Problem DescriptionPrincess CJB has lived almost her entire life in the isolated town of Ertona, where CJB uses her unique ability to recognize where crystals of materials are buried. By way of a fateful encounter, CJB learns of the Alchemy Exam and decid原创 2020-07-29 15:04:24 · 341 阅读 · 0 评论 -
Roadblocks POJ - 3255(次短路)
Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has decided to take the second-shortest rather than the原创 2020-07-23 19:47:15 · 292 阅读 · 0 评论 -
P4878 [USACO05DEC]Layout G(差分约束,判负环)
白书原题,但是POJ数据较弱,有些没判到思路:可以定义d[i]d[i]d[i]为点1到点iii的距离,则题意可以转换为d[y]≤d[x]+wd[y]≤d[x]+wd[y]≤d[x]+wd[i]≤d[i+1]d[i]≤d[i+1]d[i]≤d[i+1]d[x]≤d[y]−wd[x]≤d[y]-wd[x]≤d[y]−w这个不等式集成为差分约束系统。我们要求解的不等式d[n]−d[1]≤xd[n]-d[1]≤xd[n]−d[1]≤x左边部分的最大值则易得当d[n]−d[1]d[n]-d[1]d..原创 2020-07-23 10:52:20 · 296 阅读 · 0 评论 -
Eight Digital Games Gym - 102623E(建图,枚举排列)
Setsuna has been obsessed with an electronic video game called “Eight Digital”. It is a puzzle game which is too difficult for Setsuna, so she has been stuck in the first level for a long time.In the game, you have a string of length ???? containing only原创 2020-07-10 22:04:30 · 358 阅读 · 1 评论 -
H - Hellcife is on fire Gym - 102448H(多源最短路)
The kingdom of Hellcife has several cities that are connected by some roads. One day, the king of Hellcife, Bair Jolsonaro, decided to set fire on some of these cities, just for fun. It’s known that the i-th city has a number Ti, indicating that if the fir原创 2020-06-29 14:21:00 · 372 阅读 · 0 评论 -
ACWING 344. 观光之旅(floyd回溯路径)
给定一张无向图,求图中一个至少包含3个点的环,环上的节点不重复,并且环上的边的长度之和最小。该问题称为无向图的最小环问题。你需要输出最小环的方案,若最小环不唯一,输出任意一个均可。输入格式第一行包含两个整数N和M,表示无向图有N个点,M条边。接下来M行,每行包含三个整数u,v,l,表示点u和点v之间有一条边,边长为l。输出格式输出占一行,包含最小环的所有节点(按顺序输出),如果不存在则输出’No solution.’。数据范围1≤N≤100,1≤M≤10000,1≤l<500输原创 2020-06-26 21:00:06 · 310 阅读 · 0 评论 -
A - Environment-Friendly Travel Gym102501(二维最短路)
题意:2维平面上,要从起点到终点,中间有n个站台,站台之间有边。两点距离为欧几里得距离。每个边可以坐不同交通工具对应不同碳排放量。求起点到终点距离不超过B且碳排放量最小的路径思路:二维dijkstra,定义d[i][j]d[i][j]d[i][j]为到了第iii个点距离为jjj时的最低碳排放量。#include <iostream>#include <vector>#include <algorithm>#include <cstring>.原创 2020-06-14 13:25:14 · 857 阅读 · 0 评论 -
ICPC NEAU Programming Contest 2020 K. 关键结点(最短路+割点)
题意:判断一个点在不在最短路上好办,就是从这个点到1的最短距离加上到n的最短距离加起来#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <queue>#include <iostream>#include <map>#include <string>using namespace.原创 2020-06-07 15:03:49 · 342 阅读 · 0 评论 -
AcWing 345. 牛站(floyd+矩阵递推)
给定一张由T条边构成的无向图,点的编号为1~1000之间的整数。求从起点S到终点E恰好经过N条边(可以重复经过)的最短路。注意: 数据保证一定有解。输入格式第1行:包含四个整数N,T,S,E。第2…T+1行:每行包含三个整数,描述一条边的边长以及构成边的两个点的编号。输出格式输出一个整数,表示最短路的长度。数据范围2≤T≤100,2≤N≤106输入样例:2 6 6 411...原创 2020-03-27 14:53:14 · 271 阅读 · 0 评论 -
ACWING343. 排序(floyd闭包)
给定 n 个变量和 m 个不等式。其中 n 小于等于26,变量分别用前 n 的大写英文字母表示。不等式之间具有传递性,即若 A>B 且 B>C ,则 A>C。请从前往后遍历每对关系,每次遍历时判断:如果能够确定全部关系且无矛盾,则结束循环,输出确定的次序;如果发生矛盾,则结束循环,输出有矛盾;如果循环结束时没有发生上述两种情况,则输出无定解。输入格式输入包含多组测试...原创 2020-03-27 12:33:02 · 187 阅读 · 0 评论 -
ACWING341. 最优贸易(spfa 有环图dp)
C国有 n 个大城市和 m 条道路,每条道路连接这 n 个城市中的某两个城市。任意两个城市之间最多只有一条道路直接相连。这 m 条道路中有一部分为单向通行的道路,一部分为双向通行的道路,双向通行的道路在统计条数时也计为1条。C国幅员辽阔,各地的资源分布情况各不相同,这就导致了同一种商品在不同城市的价格不一定相同。但是,同一种商品在同一个城市的买入价和卖出价始终是相同的。商人阿龙来到C国旅...原创 2020-03-26 23:51:56 · 375 阅读 · 0 评论 -
ACWING340. 通信线路(分层图最短路)
在郊区有 N 座通信基站,P 条 双向 电缆,第 i 条电缆连接基站Ai和Bi。特别地,1 号基站是通信公司的总站,N 号基站位于一座农场中。现在,农场主希望对通信线路进行升级,其中升级第 i 条电缆需要花费Li。电话公司正在举行优惠活动。农产主可以指定一条从 1 号基站到 N 号基站的路径,并指定路径上不超过 K 条电缆,由电话公司免费提供升级服务。农场主只需要支付在该路径上剩余的电缆...原创 2020-03-24 14:59:21 · 327 阅读 · 0 评论 -
Help Jimmy POJ - 1661(dp/最短路)
“Help Jimmy” 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者选择让它向左还是向右跑,它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时,开始继续下落。Jimmy每次下落的高度不能超过MAX米,不然就会...原创 2020-02-09 00:19:23 · 265 阅读 · 0 评论 -
Saving James Bond HDU - 1245(多源点 floyd)
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 ...原创 2020-01-14 23:34:31 · 189 阅读 · 0 评论 -
Cow Hurdles POJ - 3615(floyd 单端路最大值最小)
Farmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want to be able to use as ...原创 2020-01-14 19:39:49 · 162 阅读 · 0 评论 -
Graph HDU - 4034(floyd)
Everyone knows how to calculate the shortest path in a directed graph. In fact, the opposite problem is also easy. Given the length of shortest path between each pair of vertexes, can you find the ori...原创 2020-01-13 22:58:15 · 199 阅读 · 0 评论 -
How Many Maos Does the Guanxi Worth HDU - 5137(最短路)
“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...原创 2020-01-13 18:30:06 · 299 阅读 · 0 评论 -
The path HDU - 5385(最短路构造)
You have a connected directed graph.Let d(x) be the length of the shortest path from 1 to x.Specially d(1)=0.A graph is good if there exist x satisfy d(1)<d(2)<…d(x)>d(x+1)>…d(n).Now you n...原创 2019-11-14 21:42:03 · 365 阅读 · 0 评论 -
洛谷P1119 灾后重建(floyd k值应用)
题目背景BB地区在地震过后,所有村庄都造成了一定的损毁,而这场地震却没对公路造成什么影响。但是在村庄重建好之前,所有与未重建完成的村庄的公路均无法通车。换句话说,只有连接着两个重建完成的村庄的公路才能通车,只能到达重建完成的村庄。题目描述给出BB地区的村庄数NN,村庄编号从00到N-1N−1,和所有MM条公路的长度,公路是双向的。并给出第ii个村庄重建完成的时间t_iti ,你可以认...原创 2019-11-13 20:20:10 · 274 阅读 · 0 评论 -
洛谷P1144 最短路计数
展开题目描述给出一个NN个顶点MM条边的无向无权图,顶点编号为1-N1−N。问从顶点11开始,到其他每个点的最短路有几条。输入格式第一行包含22个正整数N,MN,M,为图的顶点数与边数。接下来MM行,每行22个正整数x,yx,y,表示有一条顶点xx连向顶点yy的边,请注意可能有自环与重边。输出格式共NN行,每行一个非负整数,第ii行输出从顶点11到顶点ii有多少条不同的最短路,由于答...原创 2019-11-13 19:22:20 · 562 阅读 · 0 评论 -
洛谷P1522 牛的旅行 Cow Tours(floyd)
题目描述农民 John的农场里有很多牧区。有的路径连接一些特定的牧区。一片所有连通的牧区称为一个牧场。但是就目前而言,你能看到至少有两个牧区通过任何路径都不连通。这样,Farmer John就有多个牧场了。John想在牧场里添加一条路径(注意,恰好一条)。对这条路径有以下限制:一个牧场的直径就是牧场中最远的两个牧区的距离(本题中所提到的所有距离指的都是最短的距离)。考虑如下的有5个牧区的牧场...原创 2019-11-13 12:23:49 · 217 阅读 · 0 评论 -
P1339 [USACO09OCT]热浪Heat Wave(最短路水题)
题目描述The good folks in Texas are having a heatwave this summer. Their Texas Longhorn cows make for good eating but are not so adept at creating creamy delicious dairy products. Farmer John is leading ...原创 2019-11-13 10:37:04 · 208 阅读 · 0 评论 -
洛谷P1346 电车(floyd)
题目描述在一个神奇的小镇上有着一个特别的电车网络,它由一些路口和轨道组成,每个路口都连接着若干个轨道,每个轨道都通向一个路口(不排除有的观光轨道转一圈后返回路口的可能)。在每个路口,都有一个开关决定着出去的轨道,每个开关都有一个默认的状态,每辆电车行驶到路口之后,只能从开关所指向的轨道出去,如果电车司机想走另一个轨道,他就必须下车切换开关的状态。为了行驶向目标地点,电车司机不得不经常下车来切换...原创 2019-11-13 10:21:00 · 277 阅读 · 0 评论 -
Destroying Roads CodeForces - 543B(最短路)
In some country there are exactly n cities and m bidirectional roads connecting the cities. Cities are numbered with integers from 1 to n. If cities a and b are connected by a road, then in an hour yo...原创 2019-11-02 12:38:13 · 386 阅读 · 0 评论 -
P1948 [USACO08JAN]电话线Telephone Lines(二分,最短路)
题目描述Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to connect his farm to the phone sy...原创 2019-10-26 22:16:21 · 306 阅读 · 0 评论 -
P1462 通往奥格瑞玛的道路(最短路,二分)
题目背景在艾泽拉斯大陆上有一位名叫歪嘴哦的神奇术士,他是部落的中坚力量有一天他醒来后发现自己居然到了联盟的主城暴风城在被众多联盟的士兵攻击后,他决定逃回自己的家乡奥格瑞玛题目描述在艾泽拉斯,有n个城市。编号为1,2,3,…,n。城市之间有m条双向的公路,连接着两个城市,从某个城市到另一个城市,会遭到联盟的攻击,进而损失一定的血量。每次经过一个城市,都会被收取一定的过路费(包括起点和终...原创 2019-10-26 19:02:21 · 221 阅读 · 0 评论 -
BZOJ2200. [Usaco2011 Jan]道路和航线(spfa优化,dij)
DescriptionFarmer John正在一个新的销售区域对他的牛奶销售方案进行调查。他想把牛奶送到T个城镇 (1 <= T <= 25,000),编号为1T。这些城镇之间通过R条道路 (1 <= R <= 50,000,编号为1到R) 和P条航线 (1 <= P <= 50,000,编号为1到P) 连接。每条道路i或者航线i连接城镇A_i (1 <...原创 2019-10-22 14:23:07 · 384 阅读 · 1 评论 -
G - Candies POJ - 3159(差分约束)
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...原创 2019-08-14 23:46:34 · 145 阅读 · 0 评论 -
C - Big Christmas Tree POJ - 3013(最短路,转换)
Christmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right picture.The tree can be represented as ...原创 2019-08-15 00:29:43 · 248 阅读 · 0 评论 -
Sightseeing trip POJ - 1734(找环)
There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the town. To earn as much as possible from this attraction...原创 2019-08-22 00:07:55 · 156 阅读 · 0 评论