随笔分类 - 深度优先dfs
摘要:题目:http://poj.org/problem?id=2965来源:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26732#problem/B题意:就是把题目中给出的状态图,全部翻转成----------------状态翻转: 每次翻转一个,那么它所在的行和列都要翻转问最小翻转次数,同时输出翻转路径.算法:暴力 + 枚举 + dfs思路:可以证明每个把手要么翻转,要么不翻转,那么从左到右,从上到下依次枚举每个把手,同时深搜一遍即可。和前面的棋盘翻转一样.[POJ 1753 Flip Game] 做了棋盘翻转都纠结了半天才出了这
阅读全文
摘要:搜索专题(Newer)题解:A bfs依次遍历周围的八个方向(马走日)B bfs注意记录当前方向和转弯数C bfs入门题目,注意要清空队列D dfs入门,周围加边四个方向深搜即可。E dfs.八连块问题 只要周围的八个方向的图是一样的,则都算是同一个八连块,记录共有多少个八连块即可。D dfs 深度遍历每一条路即可,只是要边遍历边记录路径,最后输出路径就好了E dfs+奇偶剪枝优化IDTitle13/19Problem AKnight Moves6/38Problem B逃离迷宫8/40Problem CCatch That Cow8/8Prob...
阅读全文
摘要:原题链接:http://poj.org/problem?id=2488我的链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=19651#problem/AA Knight's JourneyTime Limit:1000MSMemory Limit:65536KTotal Submissions:23452Accepted:7944DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again
阅读全文
摘要:DFS 水题原题链接:http://poj.org/problem?id=3620我的链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=19651#problem/BAvoid The LakesTime Limit:1000MSMemory Limit:65536KTotal Submissions:5563Accepted:2995DescriptionFarmer John's farm was flooded in the most recent storm, a fact only aggravated by t
阅读全文
摘要:方法:一、枚举(此处所用) 二、用二进制记录下标(尚未实现) 三、类比于玩魔方游戏(思路来自黄超,尚未实现)原题链接:http://poj.org/problem?id=1753Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:21024Accepted:9108DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side ...
阅读全文
摘要:方法:一、枚举(此处所用) 二、用二进制记录下标(尚未实现) 三、类比于玩魔方游戏(思路来自黄超,尚未实现)原题链接:http://poj.org/problem?id=1753Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:21024Accepted:9108DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side ...
阅读全文

浙公网安备 33010602011771号