最短路/层次图/次短路
关注
分享
扫一扫
等我学会后缀自动机
侠影之谜
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDU 6386 Age of Moyu (最短路变形+堆优化)
Age of MoyuTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3125 Accepted Submission(s): 981 Problem DescriptionMr.Quin love fishes ...原创 2018-08-19 08:55:18 · 360 阅读 · 0 评论 -
HDU 6071 Lazy Running (同余最短路)
题目链接：http://acm.hdu.edu.cn/search.php?action=listproblem#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define r...原创 2018-10-10 23:22:17 · 201 阅读 · 0 评论 -
UVA 11280 Flying to Fredericton (Dijkstra变种)
题目链接：https://cn.vjudge.net/problem/UVA-11280#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x,y) sca...原创 2018-10-10 00:38:39 · 175 阅读 · 0 评论 -
UVA 11367 Full Tank? (Dijkstra 变种)
题目链接：https://cn.vjudge.net/problem/UVA-11367#include<bits/stdc++.h>//#include<iostream>//#include<queue>//#include<cstring>//#include<cstdio>using namespace std;...原创 2018-10-09 22:27:17 · 255 阅读 · 0 评论 -
HDU 5433 Xiao Ming Climbing (DIjksta最短路+细节)*
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5433#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-07 12:56:57 · 189 阅读 · 0 评论 -
HDU 5418 Victor and World (状压DP+FLoyd)*
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5418#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-28 07:32:35 · 242 阅读 · 0 评论 -
HDU - 4640 Island and study-sister （状压DP+背包+最短路）
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4640#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-11 17:11:33 · 712 阅读 · 0 评论 -
UVA 1569 Multiple (最短路+同余性质约束)
题目链接：https://cn.vjudge.net/problem/UVA-1569#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) fo...原创 2018-09-07 11:07:21 · 199 阅读 · 0 评论 -
HDU 5521 Meeting (最短路+含有团的差分约束)
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5521#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(...原创 2018-09-06 23:44:03 · 119 阅读 · 0 评论 -
UVA 10798 Be wary of Roses (BFS+几何状态对称)*
题目链接：https://cn.vjudge.net/problem/UVA-10798#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) ...原创 2018-09-08 06:28:51 · 266 阅读 · 0 评论 -
HDU 5876 Sparse Graph （DFS+补图）
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5876#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll uns...原创 2019-02-07 21:29:59 · 238 阅读 · 0 评论