CaptainSlow

前言抽完奖留45分钟打TC，刺激…T1 VerySecureEncryption题意给你一个字符串和一组键值，要求你一次操作将原串按键值映射成新串。求K次操作后的串。分析按题意模拟即可贺代码就这么短string VerySecureEncryption::encrypt(string message, vector <int>...

前言最近打TC，做到DP的题很多，以树型DP为主。觉得这些题都挺好的，解出来也是用了不少时间。因此，决定写几篇题解在巩固一下。题意给出两个数NNN和MODMODMOD，对于NNN的所有全排列，对于每个全排列建笛卡尔树TTT，定义TTT的分值为其所有有两个子节点的节点两子节点在原排列中索引的差值（非负值）之和。求这个所有TTT的分值之和XXX对MODMODMOD取模后的值。约...

题面You are a genealogist specializing in family trees of vampires. Vampire family trees differ from human family trees. In particular, there are two ways how a vampire can be “born”:A living human...

题意有一个序列AAA，矩阵SSS表示AAA中的元素两两的异或值。即Si,j=AixorAj,0≤i,j≤NSi,j=AixorAj,0≤i,j≤NS_{i,j}=A_i xor A_j,0 \leq i,j \leq N，NNN为序列的元素个数。你的任务是对于给定的SSS，求出满足条件的AAA的个数，满足对于∀Ai∀Ai\forall A_i，都有0≤Ai≤M0≤Ai≤M0 \leq A_i ...

前言TC百题计划，走起！题目描述今有一图青山绿水，山神安山NNN座。重峦叠嶂，峰峰起伏如此：For 0 <= i < N: For 0 <= x < W: For 0 <= y <= Y[i] - |x - X[i]|: pix[x, y] := 'X'即是：..X....XX...

前言头一道计算几何题，现学现用… 题目描述 En Paco collects penguins. His penguins like to play and run around on the ice where he lives. In order to keep his penguins safe he decided to construct a single ...

题目描述 En Percy is a penguin in charge of the greatest penguin pastime, penguin sledding. It is Percy’s job to help design the sledding course. Percy is a very careful penguin and would like to...