自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(33)
  • 收藏
  • 关注

原创 多校第十场——1011 Task Scheduler

Problem Description ByteCompany has a server cluster with m workers, k of which are somehow disconnected. The task scheduler have just received n tasks, and the i-th task needs to be executed on ti workers. For an executive order of p1,p2,…pn, the task sch

2020-09-02 00:20:56 233

原创 多校第十场——1004 Permutation Counting

Problem Description For a given permutation a1,a2,⋯,an of length n, we defined the neighbor sequence b of a, the length of which is n−1, as following: . For example, the neighbor sequence of permutation 1,2,3,6,4,5 is 0,0,0,1,0. Now we give you an integer

2020-09-02 00:03:01 272

原创 多校第十场——1003 Mine Sweeper

Problem Description A mine-sweeper map can be expressed as an r×c grid, and each cell of the grid is either mine cell or non-mine cell. A mine cell has no number on it, while a non-mine cell has a number, the number of mine cells that share at least one co

2020-09-01 23:44:13 247

原创 多校第九场——1001 Tree

Problem Description You are given a tree consisting of n vertices numbered 1 to n rooted at node 1. The parent of the i-th vertices is pi. You can move from a vertex to any of its children. What’s more, you can add one directed edge between any two differe

2020-09-01 23:35:47 214

原创 多校第八场——1009 Isomorphic Strings

Problem Description It is preferrable to read the pdf statment. Two strings are called cyclical isomorphic if one can rotate one string to get another one. ‘Rotate’ here means ‘‘to take some consecutive chars (maybe none) from the beginning of a string and

2020-09-01 23:19:36 221

原创 多校第八场——1008 Hexagon

Problem Description It is preferrable to read the pdf statment. If the world is a hexagon, I will take as many turns as possible before reaching the end. Cuber QQ has constructed a hexagon grid with radius n. This will be better if explained in a picture.

2020-09-01 23:05:33 177

原创 多校第八场——1006 Fluctuation Limit

Problem Description It is preferrable to read the pdf statment. Cuber QQ has signed up for a gambling game, that challenges him to predict the stock price of Quber CC Limited, for the next following n days. He shall make his prediction by filling a table w

2020-09-01 22:32:43 152

原创 多校第八场——1003 Clockwise or Counterclockwise

Problem Description It is preferrable to read the pdf statment. After some basic geometric lessons, Cuber QQ has learned that one can draw one and only one circle across three given distinct points, on a 2D plane. Specialized in art, Cuber QQ has shown rem

2020-09-01 22:26:26 154

原创 多校第七场——1010 Jogging

Problem Description Notice:Don’t output extra spaces at the end of one line. Dodo bird is jogging on an infinite 2-d plane, starting from (x0,y0). For a point(x,y), it is regarded as good if and only if gcd(x,y)>1. Dodo bird will walk infinite steps on

2020-08-17 00:22:29 221

原创 多校第七场——1009 Increasing and Decreasing

Problem Description Notice:Don’t output extra spaces at the end of one line. Given n,x,y, please construct a permutation of length n, satisfying that: The length of LIS(Longest Increasing Subsequence) is equal to x. The length of LDS(Longest Decreasing Su

2020-08-16 23:13:33 223

原创 多校第七场——1007 Game

Problem Description Notice:Don’t output extra spaces at the end of one line. Dodo bird and ddd are playing a stone game on a 2-d plane. There are n points on the plane where they can put the stone. The rule is as follows: Before the game start, The stone

2020-08-16 22:25:42 156

原创 多校第六场——1009 Divisibility

Problem Description You are given two 10-based integers b and x, and you are required to determine the following proposition is true or false: For arbitrary b-based positive integer y=c1c2⋯cn¯¯¯¯¯¯¯¯¯¯¯¯¯ (ci is the i-th dight from left of y), define f(y)=

2020-08-11 18:26:21 208

原创 多校第六场——1006 A Very Easy Graph Problem

Problem Description An undirected connected graph has n nodes and m edges, The i-th edge’s length is 2i. Each node i has a value ai, which is either 0 or 1. You need to calculate: ∑i=1n∑j=1nd(i,j)×[ai=1∧aj=0] d(i,j) indicates the shortest distance between

2020-08-11 18:20:48 132

原创 多校第六场——1002 Little Rabbit‘s Equation

Problem Description Little Rabbit is interested in radix. In a positional numeral system, the radix is the number of unique digits, including the digit 0, used to represent numbers. For example, for the decimal system (the most common system in use today)

2020-08-11 16:27:01 175

原创 多校第六场——1001 Road To The 3rd Building

Problem Description Because of the thriller adventure game The 3rd Building, there are fewer and fewer students who would like to go to the 3rd Building. So few students are working in the studio in the 3rd Building. Students are even more reluctant to go

2020-08-11 15:45:15 214

原创 多校第五场——1012 Set1

Problem Description You are given a set S={1…n}. It guarantees that n is odd. You have to do the following operations until there is only 1 element in the set: Firstly, delete the smallest element of S. Then randomly delete another element from S. For each

2020-08-09 22:50:05 192

原创 多校第五场——1009 Paperfolding

Problem Description There is a piece of paper in rectangular shape with sufficient length and width (lay flat on the table). Execute an operation instruction according to a string of length n from left to right that only contains 4 different characters of

2020-08-09 22:25:21 199

原创 多校第五场——1003 Boring Game

Problem Description Given n sheets of paper, place them on the table in pile and fold them in half k times from left to right. Now from top to bottom, mark a number on paper at each side of the front and back. So there are 2×n×2k numbers in total and these

2020-08-09 17:39:33 263

原创 多校第五场——1001 Tetrahedron

Problem Description Generate three integers a, b, and c in [1,n] with equal probability independently, and use them as the three right-angle side length of a right-angled tetrahedron. Find the expectation of the reciprocal square of the distance from the r

2020-08-09 17:30:46 176

原创 多校第四场——1007 Go Running

Problem Description Zhang3 is the class leader. Recently she’s implementing a policy about long-distance running. This forces every student in her class to take a run. There is a main road in the school from west to east, which can be regarded as an infini

2020-08-04 13:50:18 282

原创 多校第四场——1005 Equal Sentences

Problem Description Sometimes, changing the order of the words in a sentence doesn’t influence understanding. For example, if we change “what time is it”, into “what time it is”; or change “orz zhang three ak world final”, into “zhang orz three world ak fi

2020-08-04 13:26:42 226

原创 多校第四场——1004 Deliver the Cake

Problem Description It is Zhang3’s birthday! Zhang3 has bought a birthday cake and now it’s time to take it home. There are n villages, labeled 1,2,…,n. There are m bidirectional roads, the ith of which connects village ai, bi and it is di meter(s) long. T

2020-08-04 13:22:16 184

原创 多校第四场——1002 Blow up the Enemy

Problem Description Zhang3 is playing a shooting game with Father. In the game there are two players trying to kill each other to win the game. The game provides n weapons, each has two properties: Damage and Delay. The ith weapon has Damage Ai and Delay D

2020-08-03 21:06:12 275

原创 多校第四场——1011 Kindergarten Physics

Problem Description Zhang3 a participant of IPhO (Immortal Physics Olympiad). The 0th problem in the contest is as follows. There are two balls that weigh a kg and b kg respectively. They can be regarded as particles in this problem, as they are small enou

2020-08-03 20:47:51 219

原创 多校第三场——1009 Little W and Contest

Problem Description Given a string P consisting of only parentheses and asterisk characters (i.e. “(”, “)” and “"), you are asked to replace all the asterisk characters in order to get a balanced parenthesis string with the shortest possible length, where

2020-08-01 23:33:45 132

原创 多校第三场——1005 Little W and Contest

Problem Description There are n members in our ACM club. Little W wants to select three persons from our club to form a new team taking part in provincial ACM contests, as it is known by all of us that any ACM contest requires a normal team to have three m

2020-08-01 22:49:07 173

原创 多校第三场——1004 Tokitsukaze and Multiple

Problem Description Tokitsukaze has a sequence of length n, denoted by a. Tokitsukaze can merge two consecutive elements of a as many times as she wants. After each operation, a new element that equals to the sum of the two old elements will replace them,

2020-08-01 22:17:25 164

原创 多校第二场——1010 Lead of Wisdom

Problem Description In an online game, “Lead of Wisdom” is a place where the lucky player can randomly get powerful items. There are k types of items, a player can wear at most one item for each type. For the i-th item, it has four attributes ai,bi,ci and

2020-07-27 18:42:14 180

原创 多校第二场——1006 The Oculus

Problem Description Let’s define the Fibonacci sequence F1,F2,… as F1=1,F2=2,Fi=Fi−1+Fi−2 (i≥3). It’s well known that every positive integer x has its unique Fibonacci representation (b1,b2,…,bn) such that: · b1×F1+b2×F2+⋯+bn×Fn=x. · bn=1, and for each i (

2020-07-27 17:49:10 119

原创 多校第二场——1001 Total Eclipse

Problem Description There are n cities and m bidirectional roads in Byteland. These cities are labeled by 1,2,…,n, the brightness of the i-th city is bi. Magician Sunset wants to play a joke on Byteland by making a total eclipse such that the brightness of

2020-07-27 17:12:14 207

原创 多校第一场——1009 Leading Robots

Problem Description Sandy likes to play with robots. He is going to organize a running competition between his robots. And he is going to give some presents to the winners. Robots are arranged in a line. They have their initial position (distance from the

2020-07-25 14:31:40 252

原创 多校第一场——1005 Fibonacci Sum

Problem Description The Fibonacci numbers are defined as below: Given three integers N, C and K, calculate the following summation: Since the answer can be huge, output it modulo 1000000009 (109+9). Input The first line contains an integer T (1≤T≤200), d

2020-07-25 02:08:11 174

原创 多校第一场——1004 Distinct Sub-palindromes

Problem Description S is a string of length n. S consists of lowercase English alphabets. Your task is to count the number of different S with the minimum number of distinct sub-palindromes. Sub-palindrome is a palindromic substring. Two sub-palindromes u

2020-07-24 21:41:20 145

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除