
BFS
BFS
米兰的小耳朵
Don't settle. Keep moving.
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Find a way HDU - 2612 两点BFS
Find a way Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16214 Accepted Submission(s): 5210Problem Description Pass a year learning in H原创 2017-07-30 13:14:22 · 269 阅读 · 0 评论 -
Pots POJ - 3414
Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18614 Accepted: 7880 Special Judge Description You are given two pots, having the volume of A and原创 2017-09-14 09:40:42 · 244 阅读 · 0 评论 -
Brexit Gym - 101490C BFS
题目链接 题目大意: Brexit 外国人的梗。。。 Britain exiting from the EU 就是说有编号为L的国家将退出欧盟,如果一个国家的伙伴中有不少于一半都要脱欧的话,那么这个国家也会离开欧盟。 求编号为x的国家会不会离开欧盟。 tho:一开始以为这可能又是个图论割点什么的题,貌似可能很难。就不自觉的咸鱼,在最后半小时发现这是搜索。 然后对这类前向星的原创 2017-09-13 20:14:21 · 404 阅读 · 0 评论 -
Oil Deposits 石油储藏HDU - 1241 BFS
Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 32389 Accepted Submission(s): 18808Problem Description The GeoSurvComp geolog原创 2017-07-28 11:37:32 · 457 阅读 · 0 评论 -
Grandpa's Walk UVALive - 6038 BFS
开始读题没弄明白。一会觉得一个起点只能开一条路,一会觉得一个起点有好几条路。最后才发现有note。。。 dfs好写,重点是判断能否成为起点 和是否走到头 #include #include #include using namespace std; int a[55][55]; int vis[55][55]; int dir[4][2]= {{0,1},{0,-1},{1,0},原创 2017-07-26 10:46:46 · 272 阅读 · 0 评论 -
Problem_FZU 2150 Fire Game BFS 两点
Problem 2150 Fire Game Accept: 2465 Submit: 8541 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description Fat brother and Maze are playing a kind of special (hentai) game原创 2017-07-26 10:16:36 · 267 阅读 · 0 评论 -
Catch That Cow POJ - 3278 BFS入门
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 94224 Accepted: 29551 Description Farmer John has been informed of the location of a fugitiv原创 2017-07-25 11:26:11 · 200 阅读 · 0 评论 -
Find The Multiple POJ - 1426
Find The Multiple Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 32778 Accepted: 13706 Special Judge Description Given a positive integer n, write a pro转载 2017-07-25 10:57:15 · 283 阅读 · 0 评论 -
Rescue HDU - 1242
Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31959 Accepted Submission(s): 11164Problem Description Angel was caught by the MOLI原创 2017-07-30 17:12:36 · 280 阅读 · 0 评论 -
非常可乐 HDU - 1495
非常可乐 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16864 Accepted Submission(s): 6835Problem Description 大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou原创 2017-09-09 19:55:39 · 796 阅读 · 0 评论