最短路
mengbi_er
一个蒟蒻JLoier
展开
-
bzoj2834: 回家的路
对于同一行和同一列的相邻的点分别建边。对行和列分层。建长度为1的边,之后SPFA即可。具体细节看代码。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; queue<int> q; struct point { int x;原创 2017-06-12 21:03:42 · 427 阅读 · 2 评论 -
Codeforces Round #420 (Div. 2) D - Okabe and City
好像并不太懂啊,先挖坑。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int inf=0x7f7f7f7f; int read() { char ch=getchar();int f=0; while(ch<'0'||ch>'9'原创 2017-06-26 14:28:12 · 278 阅读 · 0 评论 -
bzoj2662: [BeiJing wc2012]冻结
分层图最短路,每层正常建图,相邻两层间建w/2的边。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; queue<int> q; struct node { int from; int to; int w;原创 2017-07-05 19:10:04 · 310 阅读 · 0 评论 -
bzoj3408: [Usaco2009 Oct]Heat Wave 热浪
裸最短路。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<vector> using namespace std; int n,m,tot,head[2505],s,t,dis[2505]; struct cmp { bool operator原创 2017-07-05 19:18:54 · 319 阅读 · 0 评论 -
bzoj1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚
将时间视为一个点,相邻两点连长度0的边,将每个牛连u到v+1的边,spfa即可。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; queue<int> q; int read() { char ch=getchar();i原创 2017-10-09 10:27:51 · 440 阅读 · 1 评论 -
bzoj5056: OI游戏
我们van♂游戏233。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; queue<int> q; int read() { char ch=getchar();int f=0; while(ch<'0'||ch原创 2017-11-03 21:16:44 · 300 阅读 · 0 评论