CF1391C-Cyclic Permutations 题目: 题目描述: A permutation of length $ n $ is an array consisting of $ n $ distinct integers from $ 1 $ to $ n $ in arbitrary order. For example, $ [2,3,1,5,4] $ is a permutation, but $ [1,2,2] $ is not a permutation ( $ 2 $ appears twice in the array) and $ [1,3,4] $ is also not

CF1391B-Fix You 题目: 题目描述: Consider a conveyor belt represented using a grid consisting of $ n $ rows and $ m $ columns. The cell in the $ i $ -th row from the top and the $ j $ -th column from the left is labelled $ (i,j) $ . Every cell, except $ (n,m) $ , has a direction R (Right) or

CF1391A-Suborrays 题目: 题目描述: A permutation of length $ n $ is an array consisting of $ n $ distinct integers from $ 1 $ to $ n $ in arbitrary order. For example, $ [2,3,1,5,4] $ is a permutation, but $ [1,2,2] $ is not a permutation ( $ 2 $ appears twice in the array) and $ [1,3,4] $ is also not a

P3830-[SHOI2012]随机树 题目: 题目描述: 输入格式: 输入仅有一行，包含两个正整数 q, n，分别表示问题编号以及叶结点的个数。 输出格式

CF896C-Willem, Chtholly and Seniorious 题目: 题目描述: — Willem… — What’s the matter? — It seems that there’s something wrong with Seniorious… — I’ll have a look… Seniorious is made by linking special talismans in particular order. After over 500 years, the carillon is now in bad condition, so Willem decides to examine it thoroughly. Seniorious has $ n $ pieces of talisman. Willem puts

P3380-【模板】二逼平衡树（树套树） 题目: 题目描述: 您需要写一种数据结构（可参考题目标题），来维护一个有序数列，其中需要提供以下操作： 查