摘要: 赛时分析 Solved 3/6 rank 875。AB做的正常,C略慢。想直接跳D2,但是D2用到了D1的一个性质,其实不如直接先做D1就是大分了... 比赛链接:https://codeforces.com/contest/2163 A 直接sort,如果每个偶数i时,$ a_i = a_i+1$ 阅读全文
posted @ 2025-11-11 15:29 kmiao03 阅读(0) 评论(0) 推荐(0)
摘要: A-C A: group sticks by same length. Add the size of group / 3 for all groups. B: Divide into few cases, determine the maximal possible bits on in any 阅读全文
posted @ 2024-04-25 02:20 kmiao03 阅读(20) 评论(0) 推荐(0)
摘要: Used the formula for finding max and min in a cubic function. 阅读全文
posted @ 2023-11-14 04:58 kmiao03 阅读(38) 评论(0) 推荐(0)
摘要: Intro Given a math expression with + or * sign with single digit numbers (1 to 9). Support the following operations: Swap 2 number and evaluate the wh 阅读全文
posted @ 2023-11-12 01:14 kmiao03 阅读(81) 评论(0) 推荐(0)
摘要: Intro This was one of the problems I didn't do during the regional contest. One of my teammates solved it. Observation There are few things to note. F 阅读全文
posted @ 2023-11-11 07:28 kmiao03 阅读(127) 评论(0) 推荐(0)
摘要: 大致题意 从距离为$L$的起点到终点,其中有$N个$岩石,然后想要使最短跳跃距离最大化,最多可以移走$M$块岩石 解题思路 最初看到题时,会从题目出发,计算岩石的最短距离,然后进行更新 但是直接模拟的方法太笨了 可以转换一下思路,假设我们在寻找到当前石头距离不小于$k的石头,如果遇到距离小于k的石头 阅读全文
posted @ 2021-03-07 13:46 kmiao03 阅读(296) 评论(0) 推荐(0)
摘要: 原题链接: P1309 瑞士轮 这道题是NOIP2011年普及组的一道题 但是从考察内容和难度来说,还是一道挺值得做的好题 思路分析 题目知识点考到了排序,最朴素的想法当然是用快速排序,每一轮都进行一次快排,然后写完果然爆T了。。。 再重新思考,发现这道题中,winner组和loser组,内部是顺序 阅读全文
posted @ 2021-03-07 06:37 kmiao03 阅读(248) 评论(0) 推荐(0)
摘要: The Pilots Brothers' refrigerator Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 35347 Accepted: 13667 Special Judge Description The game 阅读全文
posted @ 2021-03-04 10:06 kmiao03 阅读(57) 评论(0) 推荐(0)
摘要: Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 64189 Accepted: 26478 Description Flip game is played on a rectangular 4x4 field 阅读全文
posted @ 2021-03-04 03:34 kmiao03 阅读(117) 评论(0) 推荐(0)