| Rank | Solved | A | B | C | D | E | F | G | H | I | J | K | L |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 116/1706 | 9/12 | O | O | . | . | O | Ø | O | O | O | O | O | O |
O: 当场通过
Ø: 赛后通过
.: 尚未通过
A Magic Mirror
solved by chelly
chelly's solution
签到即可
B Mathematical Curse
solved by chelly
chelly's solution
通过dp记录下前i个数字和前j个操作匹配后的最大值和最小值
C Password
unsolved
D Sequence
unsolved
E Jiu Yuan Wants to Eat
solved by chelly
chelly's solution
考虑取反操作，其实就是在unsigned long long 意义下先乘-1再加-1
然后就是很裸的树链剖分+线段树了
F Modular Production Line
upsolved by chelly
chelly's solution
首先把问题转化成：有n个带权区间，你需要选一些区间，使得每个点被区间覆盖的次数<=K，问选出区间的权值和最大是多少
对于坐标x和坐标x+1，之间连一条flow=inf,cost=0的边，然后对于一个区间[a,b]，我们给a->b连一条flow=1,cost=w的边
然后从左到右跑最大费用流即可，因为每一个流量为1的流对应的就是一次的区间选择
注意把点离散化
G Give Candies
solved by chelly
chelly's solution
(2^{n-1})
H String and Times
solved by chelly
chelly's solution
SAM维护endpos集合大小
I Save the Room
solved by ch
ch's solution
J Participate in E-sports
solved by rbb
rbb's solution
K Transport Ship
solved by chelly
chelly's solution
二进制拆分背包
L Poor God Water
solved by ch
ch's solution