sigh_的博客

Array Merge time limit per test：1 seconds memory limit per test：256 megabytes Problem Description Given two arrays AAA, BBB of length n and m separately, you have to merge them into only one array CCC (of length n+mn+mn+m) obeying the rule that the relativ

Water Level time limit per test：1 seconds memory limit per test：256 megabytes Problem Description In recent years John has very successfully settled at his new job at the office. But John doesn’t like to idly sit around while his code is compiling, so he i

New Game Plus! time limit per test：2 seconds memory limit per test：256 megabytes Problem Description Wabbit is playing a game with n bosses numbered from 1 to n. The bosses can be fought in any order. Each boss needs to be defeated exactly once. There is a

Ultraman vs. Aodzilla and Bodzilla time limit per test：2 seconds memory limit per test：1024 megabytes Problem Description Six months ago our hero, formerly known as Huriyyah, was beating all monsters in the land. Now he changed his name to Ultraman and le

Sage’s Birthday time limit per test：1 seconds memory limit per test：256 megabytes Problem Description Today is Sage’s birthday, and she will go shopping to buy ice spheres. All nnn ice spheres are placed in a row and they are numbered from 111 to nnn from

Clear the Multiset time limit per test：2 seconds memory limit per test：256 megabytes Problem Description You have a multiset containing several integers. Initially, it contains a1a_1a1​ elements equal to 1, a2a_2a2​ elements equal to 2, …, ana_nan​ element

Choosing flowers time limit per test：1 seconds memory limit per test：512 megabytes Problem Description Vladimir would like to prepare a present for his wife: they have an anniversary! He decided to buy her exactly nnn flowers. Vladimir went to a flower sho

Removing Leaves time limit per test：2 seconds memory limit per test：256 megabytes Problem Description You are given a tree (connected graph without cycles) consisting of nnn vertices. The tree is unrooted — it is just a connected undirected graph without c

Sum of Digits time limit per test：2 seconds memory limit per test：512 megabytes Problem Description Let f(x)f(x)f(x) be the sum of digits of a decimal number x. Find the smallest non-negative integer xxx such that f(x)+f(x+1)+⋯+f(x+k)=nf(x)+f(x+1)+⋯+f(x+k)

挑战 题目链接：https://www.luogu.com.cn/problem/P1686 题解： 将起始点作为原点(0,0)(0,0)(0,0)，每次移动后，坐标记为(xi,yi)(x_i,y_i)(xi​,yi​)。共n+1个点，因为捷径是直线，所以每个点只需要找到x相等或y相等的点。 暂时只考虑x相等的状态，设当前共有k个点的x相等，y分别为y1,y2,...,yky_1,y_2,...,y_ky1​,y2​,...,yk​。将y顺序排列，捷径一定是y1−>y2y_1->y_2y1​−&

Binary Subsequence Rotation time limit per test：2 seconds memory limit per test：256 megabytes Problem Description Naman has two binary strings sss and ttt of length nnn (a binary string is a string which only consists of the characters “0” and “1”). He wan

疫情控制 题目链接：https://www.luogu.com.cn/problem/P1084 题解： 对答案进行二分，然后check在时限内，能否满足题目条件。(若军队数目小于1号节点的子节点数，则无解) check：显然在规定时间内，军队的移动越靠近根节点更好。所以可以先求出时限内，每支军队能移动到的最靠近根节点的位置，可以利用倍增快速计算。 将所有能移动至根节点的军队标记为未驻扎状态，单独记录其到根节点已花费的时间，以及来自根节点的哪个子树。 DFS判断根节点每个子节点所在子树是否满足要求，若不满足

Landscaping Time Limit: 1000MS Memory Limit: 65536K Problem Description Farmer John is making the difficult transition from raising mountain goats to raising cows. His farm, while ideal for mountain...

Treasure Hunt II Time Limit: 2000 ms Memory Limit: 65536 KB Problem Description There are n cities(1, 2, … ,n) forming a line on the wonderland. city i and city i+1 are adjacent and their distance is ...

Treasure Hunting time limit per test：3 seconds memory limit per test：256 megabytes Problem Description You are on the island which can be represented as a n×mn×mn×m table. The rows are numbered from 1...