bfs
newhonor
可以不伟大,但不能卑微
展开
-
Chino with Ciste
https://ac.nowcoder.com/acm/contest/553/H 题意:给一个图找一条路使得从起点到终点拐弯次数最小; 思路:bfs;在一条路直走是遇到已经vis的不能立即退出,有可能经过这些vis的后还可以走!!!!!! #include<algorithm> #include<set> #include<vector> #inclu...原创 2019-04-12 19:46:15 · 118 阅读 · 0 评论 -
F - Honeycomb Gym - 102028F
https://cn.vjudge.net/contest/308404#problem/F #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> #include <cstdio> #...原创 2019-07-23 12:04:36 · 309 阅读 · 0 评论 -
Jumping Gym - 101147E
https://vjudge.net/problem/Gym-101147E #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> #include <cstdio> #include ...原创 2019-09-06 21:48:18 · 209 阅读 · 0 评论 -
H. Safe Path
http://codeforces.com/gym/101755/problem/H #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> #include <cstdio> #inclu...原创 2019-10-02 11:28:41 · 198 阅读 · 0 评论