<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DinnerBest的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DinnerBest</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DinnerBest]]></copyright><item><title><![CDATA[AtCoder Beginner Contest 339 D - Synchronized Players（BFS从0基础到1基础）]]></title><link>https://blog.youkuaiyun.com/DinnerBest/article/details/136019791</link><guid>https://blog.youkuaiyun.com/DinnerBest/article/details/136019791</guid><author>DinnerBest</author><pubDate>Sun, 04 Feb 2024 12:05:12 +0800</pubDate><description><![CDATA[我们用一个结构体存下两个点的坐标以及当前已经走的步数，用一个四维数组存下走过的状态

值得注意的是加入碰到超出边界或者走到路障的情况不能直接跳过，而是让他维持原状态（也就是站在原地不动），因为可能另一个点会发生变化。

由于步数是单调递增的，先重合的答案一定是最优的，所以首次重合的直接输出答案即可

如果遍历完所有状态还未重合就输出-1即可]]></description><category></category></item><item><title><![CDATA[牛客寒假训练营1 E.本题又主要考察了贪心]]></title><link>https://blog.youkuaiyun.com/DinnerBest/article/details/136012486</link><guid>https://blog.youkuaiyun.com/DinnerBest/article/details/136012486</guid><author>DinnerBest</author><pubDate>Sat, 03 Feb 2024 19:40:13 +0800</pubDate><description><![CDATA[牛子特有的诈骗题。]]></description><category></category></item></channel></rss>