<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Pt.ll的博客]]></title><description><![CDATA[just do it]]></description><link>https://blog.youkuaiyun.com/oierzyc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; oierzyc]]></copyright><item><title><![CDATA[CF757F 题解]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/150723219</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/150723219</guid><author>oierzyc</author><pubDate>Sun, 24 Aug 2025 23:18:55 +0800</pubDate><description><![CDATA[想到这一点，作者本人也走了许多弯路，最开始用的普通循环来实现缩点，结果发现无法满足无后效性的问题（需要考虑后效性的原因是：这个点缩完后，无法保证后续是否在缩其它点时会不会重复计算，然后会挂在第 14 个点上）。不难发现，在这个 DAG 中，如果我们删去的点是它到起点必须经过的点，那如果这个点被删，起点到它这只能换边，那么它的最短路径一定会发生改变。的点的多条路径没有都必须经过的点（起点除外），那么即使删去了一条最短路径上的点，它到起点的最短路径不会变。没错，这就是我们熟悉的最短路树。]]></description><category></category></item><item><title><![CDATA[5.4 比赛总结]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/147709003</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/147709003</guid><author>oierzyc</author><pubDate>Mon, 05 May 2025 10:44:22 +0800</pubDate><description><![CDATA[T1：错的很冤，直接挂了 100pts，希望下次不再犯。T2：完美ACAC！T3：真的不会，不过骗了 50pts。T4：完美ACAC！]]></description><category></category></item><item><title><![CDATA[图论基础+最短路问题（Floyd、Dijkstra、SPFA、Bellman-Ford）]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/147652398</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/147652398</guid><author>oierzyc</author><pubDate>Thu, 01 May 2025 16:54:49 +0800</pubDate><description><![CDATA[图论，说白了就是在一张图上进行各种操作，包括简单的如求最短路，难的如强连通分量。本文将带你走入图论，了解图论的基础知识与图上最短路问题。再伟大的算法，都有自己的缺陷；再完美的人，都有自己的弱点。有时候，表面上的失败可能会有意外的成功，拼运气的随机也有着底层的逻辑。或许，几千年后 OIer 在回看这 OI 界时，会不会有些许感慨，又会不会有些许享受？有时候，完美不一定是无瑕，失败不一定是不成功，随机不一定是赌运气。所以还是请大家享受随机、享受成功的失败吧。]]></description><category></category></item><item><title><![CDATA[Codeforces 1016]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/147616254</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/147616254</guid><author>oierzyc</author><pubDate>Wed, 30 Apr 2025 23:09:57 +0800</pubDate><description><![CDATA[题目：非常简单，从样例都可以看出只要 kkk 是奇数就是，反之不是。因为当 kkk 为奇数时，这个回文数中间有一个单独的数，这个数可以是任意一个数，所以很容易满足回文，但如果是偶数，就要严格满足一 一对应关系，所以明显有数不行。代码过分简单，读者自己写。（lazy~）题目：很明显，我们首先要找出最小代价是多少。很明显是 111，也就是当这个数本身与各个数位上的数相加后的和相等时成立。那在什么时候这个条件会成立？答案是只有一位数字时。这个也很明显，在此不多做讨论。那么这道题改一下就成了这样：因为题目中允许有前]]></description><category></category></item><item><title><![CDATA[2.13比赛总结（有亿点点晚）]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/147161892</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/147161892</guid><author>oierzyc</author><pubDate>Sat, 12 Apr 2025 11:11:11 +0800</pubDate><description><![CDATA[一样的数的个数，用。]]></description><category></category></item><item><title><![CDATA[Atcoder Beginner Contest 400(A-E)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/147026646</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/147026646</guid><author>oierzyc</author><pubDate>Sun, 06 Apr 2025 16:37:13 +0800</pubDate><description><![CDATA[Atcoder Beginner Contest 400题解]]></description><category></category></item><item><title><![CDATA[Atcoder Beginner Contest 244(A-F)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/146344543</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/146344543</guid><author>oierzyc</author><pubDate>Tue, 18 Mar 2025 16:13:15 +0800</pubDate><description><![CDATA[Atcoder Beginner Contest 244题解]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 245(A-F)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/146275638</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/146275638</guid><author>oierzyc</author><pubDate>Sat, 15 Mar 2025 11:55:00 +0800</pubDate><description><![CDATA[AtCoder Beginner Contest 245题解]]></description><category></category></item><item><title><![CDATA[差分约束——讲解+例题(含代码)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/146113061</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/146113061</guid><author>oierzyc</author><pubDate>Sat, 08 Mar 2025 11:15:08 +0800</pubDate><description><![CDATA[差分约束讲稿]]></description><category></category></item><item><title><![CDATA[Atcoder Beginner Contest 242(A-F)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/146073669</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/146073669</guid><author>oierzyc</author><pubDate>Thu, 06 Mar 2025 17:46:54 +0800</pubDate><description><![CDATA[Atcoder Beginner Contest 242 题解]]></description><category></category></item><item><title><![CDATA[Codeforces 1006(A-F)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/145949024</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/145949024</guid><author>oierzyc</author><pubDate>Sat, 01 Mar 2025 17:34:00 +0800</pubDate><description><![CDATA[Codeforces 1006题解]]></description><category></category></item><item><title><![CDATA[Codeforces 241E]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/145909966</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/145909966</guid><author>oierzyc</author><pubDate>Thu, 27 Feb 2025 17:45:07 +0800</pubDate><description><![CDATA[Codeforces 241E 耗时2个半小时]]></description><category></category></item><item><title><![CDATA[Atcoder Beginner Contest 241(A-F)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/145791248</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/145791248</guid><author>oierzyc</author><pubDate>Sat, 22 Feb 2025 11:46:01 +0800</pubDate><description><![CDATA[Atcoder Beginner Contest 241 题解]]></description><category></category></item><item><title><![CDATA[线段树1——您的不二选择]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/145706901</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/145706901</guid><author>oierzyc</author><pubDate>Tue, 18 Feb 2025 17:45:17 +0800</pubDate><description><![CDATA[线段树]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 393(A-D)]]></title><link>https://blog.youkuaiyun.com/oierzyc/article/details/145657169</link><guid>https://blog.youkuaiyun.com/oierzyc/article/details/145657169</guid><author>oierzyc</author><pubDate>Sat, 15 Feb 2025 22:22:27 +0800</pubDate><description><![CDATA[本体很简单，因为Takahashi吃了1和2，而Aoki吃了1和3，所以他们都为fine时，4号就有问题；同理，可以判断那个有问题。]]></description><category></category></item></channel></rss>