摘要:
Check If Digits Are Equal in String After Operations II You are given a string s consisting of digits. Perform the following operation repeatedly unti 阅读全文
摘要:
D. Eating There are slimes on a line, the -th of which has weight . Slime is able to eat another slime if ; afterwar 阅读全文
摘要:
Viva La Vida(Fried-Chicken's Version) 题目描述 鸡王国有 个城市,编号分别为 ,初始城市之间没有任何道路连接。为了灾后重建,鸡国王决定在一些城市之间修建双向道路,于是他请首席工程师瓦爵鸡根据王国的地形地貌特征,对在城市之间修建 阅读全文
摘要:
H. Bro Thinks He's Him Skibidus thinks he's Him! He proved it by solving this difficult task. Can you also prove yourself? Given a binary string$^{\te 阅读全文
摘要:
Maximum Difference Between Even and Odd Frequency II You are given a string s and an integer k. Your task is to find the maximum difference between th 阅读全文
摘要:
智乃的Notepad(Hard version) 题目描述 本题有对应的Easy Version,区别仅在Easy为单组查询,Hard为多组,保证Easy的测试用例集为Hard的子集。 智乃在练习打字,她打开电脑上的记事本,准备输入一系列单词组成的集合,她想要知道如果想在记事本上显示过这个单词集合中 阅读全文
摘要:
智乃的逆序数 题目描述 定义一个序列是“紧密”的,当且仅当序列从小到大排序后,相邻数字的差值是 ; 定义两个序列不相交的,当且仅当两个序列没有相同元素; 逆序数指的是在一个序列或者数组中,有多少对 满足 且 ; 子序列为从原数组中删除任意个(可以为零、 阅读全文
摘要:
E. Triangle Tree You are given a rooted tree containing vertices rooted at vertex . A pair of vertices is called a good pa 阅读全文
摘要:
一起看很美的日落! 题目描述 牛可乐有一棵由 个结点构成的树,第 个节点的权值为 。 我们定义一个连通块 的权值为: 当前连通块中两两结点的权值异或和,即 $\sum\limits_{i,j \in \mathbb{V}}{a_i \oplus a 阅读全文