【笔记】P1606 [USACO07FEB]Lilypad Pond G 及相关

【【笔记】P1606 [USACO07FEB]Lilypad Pond G 及相关】的更多相关文章

【笔记】P1606 [USACO07FEB]Lilypad Pond G 及相关

题目传送门建图首先,根据题目,可以判断出这是一道最短路计数问题. 但是要跑最短路,首先要用他给的信息建图,这是非常关键的一步. 根据题意,我们可以想出以下建图规则: 起点或是一个空白处可以花费 \(1\) 代价走向其八个方向. 若走到了莲叶上,则可以继续向莲叶的八个方向走,并且还是只花费 \(1\) 代价. 石头不能被走到. 不能有点在以一个固定点出发的路径上被走到两次(不是最优了). 由于权值(代价)只有 \(1\),所以不必记录,有边就代表 \(1\) 代价了. 我们可以用 \(\tex…

[USACO07FEB] Lilypad Pond

https://www.luogu.org/problem/show?pid=1606 题目描述 FJ has installed a beautiful pond for his cows' aesthetic enjoyment and exercise. The rectangular pond has been partitioned into square cells of M rows and N columns (1 ≤ M ≤ 30; 1 ≤ N ≤ 30). Some of t…

bzoj1698 / P1606 [USACO07FEB]白银莲花池Lilypad Pond

P1606 [USACO07FEB]白银莲花池Lilypad Pond 转化为最短路求解放置莲花的方法如果直接算会有重复情况. 于是我们可以先预处理和已有莲花之间直接互相可达的点,将它们连边(对,忽略它们). 于是剩下的就是边权为1的边了. 酱紫我们就成功转化为了边权问题. 蓝后跑跑最短路顺便计个数就解决了. #include<iostream> #include<cstdio> #include<cstring> #include<queue> usin…

最短路【洛谷P1606】 [USACO07FEB]荷叶塘Lilypad Pond

P1606 [USACO07FEB]荷叶塘Lilypad Pond 为了让奶牛们娱乐和锻炼,农夫约翰建造了一个美丽的池塘.这个长方形的池子被分成了M行N列个方格(1≤M,N≤30).一些格子是坚固得令人惊讶的莲花,还有一些格子是岩石,其余的只是美丽.纯净.湛蓝的水. 贝西正在练习芭蕾舞,她站在一朵莲花上,想跳到另一朵莲花上去,她只能从一朵莲花跳到另一朵莲花上,既不能跳到水里,也不能跳到岩石上. 贝西的舞步很像象棋中的马步:每次总是先横向移动一格,再纵向移动两格,或先纵向移动两格,再横向移动一格.…

洛谷 P1606 [USACO07FEB]荷叶塘Lilypad Pond 解题报告

P1606 [USACO07FEB]荷叶塘Lilypad Pond 题目描述 FJ has installed a beautiful pond for his cows' aesthetic enjoyment and exercise. The rectangular pond has been partitioned into square cells of M rows and N columns (1 ≤ M ≤ 30; 1 ≤ N ≤ 30). Some of the cells h…

P1606 [USACO07FEB]荷叶塘Lilypad Pond(最短路计数)

P1606 [USACO07FEB]荷叶塘Lilypad Pond 题目描述 FJ has installed a beautiful pond for his cows' aesthetic enjoyment and exercise. The rectangular pond has been partitioned into square cells of M rows and N columns (1 ≤ M ≤ 30; 1 ≤ N ≤ 30). Some of the cells h…