Mianyang
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite C. Catch You Catch Me 解题思路: 站在距离出口最近的点等深度深的蝴蝶飞上来即可。 时间复杂度:\(O(n)\) 代码: #include<bits/ ......
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite
Preface 久违地VP一场,由于CCPC桂林在即因此最近就自主VP一下去年的CCPC 这场打的时候全队不在状态,签完到后我就因为A题一个corner case没考虑到卡了快两个小时 然后好不容易搞过去徐神上来有狂WA E题,最后也是喜提+11 后面写的D题也是需要特判,好家伙又是快到比赛结束才看 ......
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite GCHMAD
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite 目录2022 China Collegiate Programming Contest (CCPC) Mianyang OnsiteVP 情况G - Let Them E ......
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite (2022CCPC绵阳)ACGHM
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite (2022CCPC绵阳)ACGHM https://codeforces.com/gym/104065 昨天女队vp了一下,赛时4题223罚时 A是一个dp,学妹已经写的 ......
【题解】 Call Me Call Me CCPC Mianyang 2022
https://codeforces.com/gym/104065/ 原题做法是类似猫树转成前缀后缀,写起来太麻烦,不如如下做法: 如果每个区间所需满足的点不超过 $\sqrt{n}$ 个,即可以如下暴力: 把每个区间拍到线段树上,每次更新一个点,则在线段树上把所有包含他的区间全部 $-1$ 看看是 ......