![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
妙不可言
pigzhouyb
一个来自浙江的可爱的萌萌哒的肥肥胖胖的OIer
展开
-
『妙不可言系列6』CF641D Orac and Medians
Problem\mathrm{Problem}ProblemSlime has a sequence of positive integers a1,a2,…,ana_1, a_2, \ldots, a_na1,a2,…,an .In one operation Orac can choose an arbitrary subsegment [l…r][l \ldots r][l…r] of this sequence and replace all values al,al+1,…,原创 2020-05-17 09:02:21 · 203 阅读 · 0 评论 -
『妙不可言系列5』[ABC163F] path pass i
Problem\mathrm{Problem}Problem题意:给一棵N个节点的无根树,每个节点有一个颜色属性c。对于每个颜色,求经过这种颜色的简单路径的数量。Solution\mathrm{Solution}Solution假设我们对每一个颜色分开单独考虑。我们令sum[i]sum[i]sum[i]表示我们在树上已经枚举到的过程中,所有颜色为iii的子树的总大小。对于某一节点的每一个子树,找到每一个颜色相同的,之间相隔的点两两可以形成不包含该颜色的路径,用总方案数减去这些方案数即可。原创 2020-05-13 21:30:40 · 382 阅读 · 0 评论 -
『妙不可言系列4』AtCoder ABC 158F Removing Robots
Problem\mathrm{Problem}Problem有NNN个机器人分布在数轴上不同的位置,初始为未激活状态,作为上帝,你可以手动激活任意数量的机器人。当第iii个机器人被激活时,它会向前走DiD_iDi个单位长度然后自爆,并且坐标区间在[Xi, Di)[X_i,~Di)[Xi, Di)上的机器人也会被激活往前走,从而触发连锁激活。当你选定一些机器人激活后,最后剩下的机器人按编号组成集合SSS。问一共有多少个不同的集合SSS?Solution\mathrm{Soluti原创 2020-05-13 21:09:39 · 211 阅读 · 0 评论 -
『妙不可言系列3』CF1348D Phoenix and Science
Problem\mathrm{Problem}ProblemPhoenix has decided to become a scientist! He is currently investigating the growth of bacteria.Initially, on day 111 , there is one bacterium with mass 111 .Every day...原创 2020-05-08 17:08:25 · 193 阅读 · 0 评论 -
『妙不可言系列1』CF635D:Xenia and Colorful Gems
Problem\mathrm{Problem}ProblemXenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.Recently Xenia has bought nrn_rnr...原创 2020-04-22 18:44:47 · 380 阅读 · 0 评论