Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P1135\":[\"奇怪的电梯\",83773,null],\"洛谷-P4667\":[\"Switch the Lamp On\",5269,\"BalticOI 2011 Day1\"],\"POJ-3322\":[\"Bloxorz I\",1776,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.08.05\\\"\\u003ePOJ Monthly--2007.08.05\\u003c/a\\u003e, Rainer\\u003c/div\\u003e\"],\"洛谷-P3139\":[\"Milk Pails S\",735,\"USACO16FEB\"],\"洛谷-P6207\":[\"Cows on Skates G\",4379,\"USACO06OCT\"],\"洛谷-P1379\":[\"八数码难题\",28875,null],\"洛谷-P2864\":[\"The Grove S\",582,\"USACO06JAN\"],\"洛谷-P2841\":[\"A*B Problem\",1378,null],\"洛谷-P3956\":[\"棋盘\",32124,\"NOIP2017 普及组\"],\"洛谷-P1930\":[\"亚瑟王的宫殿\",932,\"USACO3.3\"],\"洛谷-P2725\":[\"邮票 Stamps\",6910,\"USACO3.1\"],\"CSES-1667\":[\"Message Route\",24196,\"Graph Algorithms\"],\"黑暗爆炸-2252\":[\"矩阵距离 \",416,\"2010Beijing wc\"],\"洛谷-P2296\":[\"寻找道路\",16601,\"NOIP2014 提高组\"],\"洛谷-P1144\":[\"最短路计数\",40095,null],\"洛谷-P5663\":[\"加工零件\",13331,\"CSP-J2019\"],\"计蒜客-T1215\":[\"拯救公主\",385,null],\"洛谷-P1443\":[\"马的遍历\",95236,null],\"洛谷-P2411\":[\"Silver Lilypad Pond S\",389,\"USACO07FEB\"],\"洛谷-P2730\":[\"魔板 Magic Squares\",5463,\"USACO3.2\"],\"洛谷-P2895\":[\"Meteor Shower S\",21925,\"USACO08FEB\"],\"POJ-1475\":[\"Pushing Boxes\",2426,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1997\\\"\\u003eSouthwestern European Regional Contest 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P6757\":[\"Tracks in the Snow\",119,\"BalticOI2013\"],\"CSES-1194\":[\"Monsters\",11324,\"Graph Algorithms\"],\"洛谷-P8817\":[\"假期计划\",6585,\"CSP-S 2022\"],\"POJ-2044\":[\"Weather Forecast\",673,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2003\\\"\\u003eJapan 2003\\u003c/a\\u003e,Aizu\\u003c/div\\u003e\"],\"洛谷-P1126\":[\"机器人搬重物\",14317,null],\"洛谷-P1588\":[\"Catch That Cow S\",9808,\"USACO07OPEN\"],\"CSES-1193\":[\"Labyrinth\",21556,\"Graph Algorithms\"],\"POJ-3635\":[\"Full Tank?\",3689,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNordic+2007\\\"\\u003eNordic 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"洛谷-P1649\":[\"Obstacle Course S\",4418,\"USACO07OCT\"],\"洛谷-P1825\":[\"Corn Maze S\",15753,\"USACO11OPEN\"],\"洛谷-P2937\":[\"Laserphones S\",1931,\"USACO09JAN\"],\"CodeForces-1070A\":[\"Find a Number\",2456,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1070\\\"\\u003e2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"洛谷-P5195\":[\"Knights of Ni S\",1808,\"USACO05DEC\"],\"洛谷-P3395\":[\"路障\",5318,null],\"洛谷-P1032\":[\"字串变换\",27594,\"NOIP2002 提高组\"],\"洛谷-P2385\":[\"Bronze Lilypad Pond B\",2227,\"USACO07FEB\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"beyoursven","updateTime":1676273811000,"title":"BFS","dislikeCnt":0,"content":"# BFS 基础\n[problem:洛谷-P1588] BFS 板子\n[problem:洛谷-P1443] 网格图,BFS 板子\n[problem:CSES-1193] 网格图,BFS 输出最短路径\n[problem:CSES-1667] 图,BFS 输出最短路径\n[problem:洛谷-P6207] 网格图,BFS 输出最短路径\n[problem:洛谷-P1144] 最短路计数\n[problem:洛谷-P3395]\n[problem:洛谷-P1126]\n[problem:黑暗爆炸-2252] 多源 BFS\n[problem:CSES-1194] 多源 BFS\n[problem:洛谷-P2385]\n\n# 从状态图遍历(FloodFill)到 BFS\n[problem:洛谷-P1135]\n[problem:洛谷-P3139]\n[problem:洛谷-P2725]\n[problem:洛谷-P5663]\n\n# 0-1 BFS\n[problem:洛谷-P4667] 0-1 BFS\n[problem:洛谷-P2937]\n[problem:洛谷-P6757]\n[problem:洛谷-P2411]\n\n# 优先队列 BFS\n[problem:洛谷-P3956] 优先队列 BFS\n[problem:洛谷-P4779]\n[problem:POJ-3635] 优先队列 BFS\n\n# BFS 较难题\n通常指状态设计较难,或者转移、代码实现起来较为复杂。\n[problem:洛谷-P2841]\n[problem:洛谷-P2730]\n[problem:洛谷-P1379] BFS,较难\n[problem:POJ-3322] BFS,较难\n[problem:POJ-1475] BFS,双属性,较难\n\n# 其他\n[problem:洛谷-P2895]\n[problem:洛谷-P5195]\n[problem:洛谷-P1825]\n[problem:洛谷-P1032]\n[problem:洛谷-P1649]\n[problem:计蒜客-T1215]\n[problem:洛谷-P2864]\n[problem:洛谷-P2296]\n[problem:洛谷-P1930]\n[problem:POJ-2044]\n[problem:CodeForces-1070A]\n[problem:洛谷-P8817]","threadId":137167,"likeCnt":3,"createTime":1676189314000,"isWorkbook":true,"viewCnt":1223,"openness":2,"fav":false,"id":3457,"trustable":false}