<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Resot的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Resot</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Resot]]></copyright><item><title><![CDATA[【打破信息差】萌新认识与入门算法竞赛]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/152094861</link><guid>https://blog.youkuaiyun.com/Resot/article/details/152094861</guid><author>Resot</author><pubDate>Thu, 25 Sep 2025 22:38:59 +0800</pubDate><description><![CDATA[【打破信息差】萌新认识与入门算法竞赛]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1023 (Div. 2) (A-D)]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147749148</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147749148</guid><author>Resot</author><pubDate>Tue, 06 May 2025 22:40:29 +0800</pubDate><description><![CDATA[每周至少五篇博客：(1/5)]]></description><category></category></item><item><title><![CDATA[题解传送门]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147673530</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147673530</guid><author>Resot</author><pubDate>Fri, 02 May 2025 23:25:15 +0800</pubDate><description><![CDATA[做个算法分类，这样找特定算法的题目就方便多了23333。]]></description><category></category></item><item><title><![CDATA[为美好的XCPC献上典题 ABC359 G - Sum of Tree Distance（根号分治）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147673303</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147673303</guid><author>Resot</author><pubDate>Fri, 02 May 2025 23:00:08 +0800</pubDate><description><![CDATA[每周至少五篇博客：（4/5）第五篇打算由更新一下题解传送门补充。]]></description><category></category></item><item><title><![CDATA[[算法学习]——通过RMQ与dfs序实现O(1)求LCA（含封装板子）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147670011</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147670011</guid><author>Resot</author><pubDate>Fri, 02 May 2025 17:13:39 +0800</pubDate><description><![CDATA[每周五篇博客：（3/5）]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1022 (Div. 2) D. Needle in a Numstack（二分）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147668665</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147668665</guid><author>Resot</author><pubDate>Fri, 02 May 2025 15:09:04 +0800</pubDate><description><![CDATA[每周至少五篇博客：（2/5）]]></description><category></category></item><item><title><![CDATA[[算法学习]——dfs序]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147652778</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147652778</guid><author>Resot</author><pubDate>Thu, 01 May 2025 15:41:04 +0800</pubDate><description><![CDATA[按照深度优先搜索（DFS）的访问顺序对树节点进行排序，即得到树的dfs序。]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 242 G - Range Pairing Query （莫队）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147570387</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147570387</guid><author>Resot</author><pubDate>Sun, 27 Apr 2025 22:42:06 +0800</pubDate><description><![CDATA[每周五篇博客：（5/5） 我做到了！这题主要是想给大家提供一份莫队的板子，很多莫队题基本上填空就差不多了（]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1021 (Div. 2) D. Baggage Claim（建图）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147569850</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147569850</guid><author>Resot</author><pubDate>Sun, 27 Apr 2025 22:08:50 +0800</pubDate><description><![CDATA[每周五篇博客：（4/5）]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1020 (Div. 3) F,G1]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147528365</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147528365</guid><author>Resot</author><pubDate>Sat, 26 Apr 2025 10:38:53 +0800</pubDate><description><![CDATA[每周五篇博客：（3/5）]]></description><category></category></item><item><title><![CDATA[为美好的XCPC献上典题——ABC310 F - Make 10 Again （状压概率dp）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147466327</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147466327</guid><author>Resot</author><pubDate>Thu, 24 Apr 2025 00:14:12 +0800</pubDate><description><![CDATA[每周至少五篇博客：（2/5）]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 243 E - Edge Deletion（Floyd）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147465223</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147465223</guid><author>Resot</author><pubDate>Wed, 23 Apr 2025 22:50:48 +0800</pubDate><description><![CDATA[每周至少五篇博客：（1/5）]]></description><category></category></item><item><title><![CDATA[为美好的XCPC线上典题——EDU89 D. Two Divisors（数论）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147377978</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147377978</guid><author>Resot</author><pubDate>Sun, 20 Apr 2025 23:53:23 +0800</pubDate><description><![CDATA[题外话：写这题时我一开始想了个错的证明交上去A了，写这博客的证明的时候才发现自己想错了，这个证明是我看了官方题解写的，感觉整除转取模意义下的运算的思想很实用。代码实现上比较简单，用埃氏筛可以直接筛出来每个数的最小质因子，然后让这个最小质因子为。的任何质因子都不整除，既然没有共同的质因子，那么二者一定是互质的，即。需要互质，不然的话他们的和会是相同因数的倍数。二者没有相同的质因子，为了简化思考我们干脆令。的最大公约数），或者说不存在这样的对。的最大公约数）或说不存在这样的对。的时候是不存在合法的。]]></description><category></category></item><item><title><![CDATA[算法学习——dsu on tree]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147347827</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147347827</guid><author>Resot</author><pubDate>Sat, 19 Apr 2025 11:12:49 +0800</pubDate><description><![CDATA[dsu on tree也叫树上启发式合并，和启发式合并类似，其时间复杂度是O(nlogn)O(nlogn)O(nlogn)，核心思想也是小的集合并到大的集合中去。在学习dsu on tree之前，我们先简单回顾一下启发式合并是什么启发式合并其实是很暴力的一个思想。先只看看合并，合并就是将两个集合A,BA,BA,B合并成一个集合CCC首先有一个操作是新建一个空集合，然后将集合A,BA,BA,B的每一个元素都放进去，这个时间复杂度是遍历集合A,BA,BA,B的每一个元素，也就是size(A+B)size(A+B]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 281 F - Xor Minimization (字典树)]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147340688</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147340688</guid><author>Resot</author><pubDate>Fri, 18 Apr 2025 21:23:53 +0800</pubDate><description><![CDATA[每周至少五篇博客：(3/5)]]></description><category></category></item><item><title><![CDATA[为美好的XCPC献上典题——Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) F. Kuroni and th]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147338826</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147338826</guid><author>Resot</author><pubDate>Fri, 18 Apr 2025 18:57:50 +0800</pubDate><description><![CDATA[每周至少五篇博客：2/5。]]></description><category></category></item><item><title><![CDATA[[算法学习]——可持久化权值线段树求区间第k小（主席树）]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147325585</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147325585</guid><author>Resot</author><pubDate>Fri, 18 Apr 2025 12:18:51 +0800</pubDate><description><![CDATA[可持久化权值线段树（主席树）讲解]]></description><category></category></item><item><title><![CDATA[【竞赛工具】——vscode xcpc竞赛向配置教程]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147296133</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147296133</guid><author>Resot</author><pubDate>Thu, 17 Apr 2025 10:50:52 +0800</pubDate><description><![CDATA[vscode算法竞赛向配置教程]]></description><category></category></item><item><title><![CDATA[【竞赛工具】——sublime text4 xcpc竞赛向配置教程]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147274215</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147274215</guid><author>Resot</author><pubDate>Wed, 16 Apr 2025 12:33:35 +0800</pubDate><description><![CDATA[算法竞赛向IDE配置教程]]></description><category></category></item><item><title><![CDATA[[新手向]蓝桥杯2025省赛C++/B组个人题解]]></title><link>https://blog.youkuaiyun.com/Resot/article/details/147244546</link><guid>https://blog.youkuaiyun.com/Resot/article/details/147244546</guid><author>Resot</author><pubDate>Tue, 15 Apr 2025 11:04:28 +0800</pubDate><description><![CDATA[本文的题解代码均为solve()单独函数，基于以下代码为基础，这一块完全可以掠过不看solve();return 0;]]></description><category></category></item></channel></rss>