Alex_McAvoy的博客

Problem DescriptionThere are N towns on a plane. The i-th town is located at the coordinates (xi,yi). There may be more than one town at the same coordinates.You can build a road between two town...

Problem DescriptionSnuke is making sugar water in a beaker. Initially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perfor...

Problem DescriptionIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads. The following are known about the road network:Pe...

Problem DescriptionYou are given a permutation p1,p2,…,pN consisting of 1,2,..,N. You can perform the following operation any number of times (possibly zero):Operation: Swap two adjacent elements...

Problem DescriptionYou are given an integer sequence of length N, a1,a2,…,aN.For each 1≤i≤N, you have three choices: add 1 to ai, subtract 1 from ai or do nothing.After these operations, you se...

Problem DescriptionWe have a grid with H rows and W columns of squares. Snuke is painting these squares in colors 1, 2, …, N. Here, the following conditions should be satisfied:For each i (1≤i≤N)...

Problem DescriptionWe have a board with a 2×N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1×2 or 2×1 square.Then, Snuke decided to paint these domin...

Problem DescriptionWe have N sticks with negligible thickness. The length of the i-th stick is Ai.Snuke wants to select four different sticks from these sticks and form a rectangle (including a s...

Problem DescriptionWe have a sequence of length N, a=(a1,a2,…,aN). Each ai is a positive integer.Snuke's objective is to permute the element in a so that the following condition is satisfied:Fo...

Problem DescriptionWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence become...

Problem DescriptionWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence become...

Problem DescriptionFennec and Snuke are playing a board game.On the board, there are N cells numbered 1 through N, and N−1 roads, each connecting two cells. Cell ai is adjacent to Cell bi through...

Problem DescriptionSnuke and Raccoon have a heap of N cards. The i-th card from the top has the integer ai written on it.They will share these cards. First, Snuke will take some number of cards f...

Problem DescriptionYou are given an integer sequence of length n+1, a1,a2,…,an+1, which consists of the n integers 1,…,n. It is known that each of the n integers 1,…,n appears at least once in this...

Problem DescriptionYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is hi at the moment of encoun...

Problem DescriptionLet N be a positive integer.There is a numerical sequence of length 3N, a=(a1,a2,…,a3N). Snuke is constructing a new sequence of length 2N, a', by removing exactly N elements f...

Problem DescriptionThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three part...

Problem DescriptionFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.Constraints2≤K≤105 Kis an integer.InputInput is given from Standard Inpu...

Problem DescriptionYou are given an integer sequence of length n, a1,…,an. Let us consider performing the following n operations on an empty sequence b.The i-th operation is as follows:Append a...

Problem DescriptionThere is a bar of chocolate with a height of H blocks and a width of W blocks. Snuke is dividing this bar into exactly three pieces. He can only cut the bar along borders of bloc...

Problem DescriptionYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is si. Your answer to each question will be jud...

Problem DescriptionIn Takahashi Kingdom, there is an archipelago ofNislands, called Takahashi Islands. For convenience, we will call them Island1, Island2, ..., IslandN.There areMkinds of ...

Problem DescriptionSnuke has N dogs and M monkeys. He wants them to line up in a row.As a Japanese saying goes, these dogs and monkeys are on bad terms. ("ken'en no naka", literally "the relation...

Problem DescriptionA robot is put at the origin in a two-dimensional plane. Initially, the robot is facing in the positive x-axis direction.This robot will be given an instruction sequence s. s c...

Problem DescriptionYou are given a sequence of positive integers of length N, a=(a1,a2,…,aN). Your objective is to remove some of the elements in a so that a will be a good sequence.Here, an sequ...

Problem DescriptionAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K. Here, a checked pattern of side K is a pattern where each square is painted blac...

Problem DescriptionAtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0,0) at time 0, then for each i between 1 and N (inclusive), he will visi...

Problem DescriptionWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is ai.Two people X and Y will play a game using this dec...

Problem DescriptionYou are given a string S consisting of 0 and 1. Find the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following op...

Problem DescriptionAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence. The sequence A needs to satisfy the conditions below:A consists of integers between X...

Problem DescriptionSnuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is ai.He can perform the following operation any number of times:Operation: Choose integers x...

Problem DescriptionTakahashi is now competing in a programming contest, but he received TLE in a problem where the answer is YES or NO.When he checked the detailed status of the submission, there...

Problem DescriptionTakahashi has N balls. Initially, an integer Ai is written on the i-th ball.He would like to rewrite the integer on some balls so that there are at most K different integers wr...

Problem DescriptionYou have N items and a bag of strength W. The i-th item has a weight of wi and a value of vi.You will select some of the items and put them in the bag. Here, the total weight o...

Problem DescriptionIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.If the switch is pushed when the shower is already emitting water, from that momen...

Problem DescriptionAtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current ...

Problem DescriptionAtCoDeer the deer and his friend TopCoDeer is playing a game. The game consists of N turns. In each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-pa...

Problem DescriptionSnuke's town has a subway system, consisting ofNstations andMrailway lines. The stations are numbered1throughN. Each line is operated by a company. Each company has an ide...

Problem DescriptionWe have a grid withHrows andWcolumns. At first, all cells were painted white.Snuke paintedNof these cells. Thei-th (1≤i≤N) cell he painted is the cell at theai-th row...

Problem DescriptionThere are N people, conveniently numbered 1 through N. They were standing in a row yesterday, but now they are unsure of the order in which they were standing. However, each pers...