最短路
【杰杰】
这个作者很懒,什么都没留下…
展开
-
P1744 采购特价商品
传送门思路:floyd模板题。#include<bits/stdc++.h>using namespace std;#define ll long longstruct node{ double x,y;}a[110];double g[110][110];bool vis[110][110];const double inf = 0x3f3f3f3f;void floyd(int n){ for(int k = 1; k <= n; k++) { f原创 2021-05-13 20:24:50 · 166 阅读 · 0 评论 -
道路重建
传送门思路:将未被毁坏的道路长度设置为0;#include<bits/stdc++.h>using namespace std;#define ll long long int g[1010][1010];int ma[1010][1010];const int inf = 0x3f3f3f3f;int n,m;int dis[1010];bool vis[1010];void dij(){ for(int k = 1; k <= n; k++) { f原创 2021-04-30 23:44:26 · 129 阅读 · 1 评论 -
Dijkstra求最短路 I
给定一个n个点m条边的有向图,图中可能存在重边和自环,所有边权均为正值。请你求出1号点到n号点的最短距离,如果无法从1号点走到n号点,则输出-1。输入格式第一行包含整数n和m。接下来m行每行包含三个整数x,y,z,表示存在一条从点x到点y的有向边,边长为z。输出格式输出一个整数,表示1号点到n号点的最短距离。如果路径不存在,则输出-1。#include<bits/stdc++.h>using namespace std;#define ll long longconst i原创 2021-03-17 21:27:51 · 92 阅读 · 0 评论 -
Anna, Svyatoslav and Maps
The main characters have been omitted to be short.You are given a directed unweighted graph without loops with n vertexes and a path in it (that path is not necessary simple) given by a sequence p1,p2,…,pm of m vertexes; for each 1≤i<m there is an arc原创 2021-03-14 16:08:26 · 76 阅读 · 0 评论 -
Til the Cows Come Home
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 back as quickly as possible.Farmer John’s field has N (2原创 2021-03-12 17:50:16 · 100 阅读 · 0 评论