2019 USP-ICMC

11 problems from 2019 USP-ICMC (contest 102302), difficulty -. 8/11 solutions verified against sample I/O.

11 items

2019 USP-ICMC

Special | 11 problems | 8/11 verified | Difficulty - | 37m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Jumping Buildings				2m 29s	✓
B	Divples				5m 38s
C	Rectangles				2m 18s	✓
D	Guessing Messages				1m 53s	✓
E	Chi's performance				2m 47s	✓
F	Drawing cards				2m 12s	✓
G	Left Stack Game				3m 41s	✓
H	Log Concave Sequences				3m 38s
I	Useless Pokemino				3m 49s
J	Weird Sanchola				5m 45s	✓
K	Candies				3m 11s	✓

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302H - Log Concave Sequences

We need to count arrays of length (N), where every element is one of (0,1,2), such that every three consecutive elements satisfy [ a{i-1}a{i+1}le ai^2. ] The answer is required modulo (10^9+7).

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302I - Useless Pokemino

Think of every Pokemino as a point ((A,D)) in the plane, where attack is the horizontal coordinate and defense is the vertical coordinate.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302B - Divples

We need to find every positive integer that is simultaneously a divisor of a and a multiple of b. The input gives the two integers a and b, with b <= a and both potentially as large as 10^12.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302K - Candies

We have an integer array C of length N. A candy sequence is any non-empty contiguous part of this array, and its value is the sum of its elements. The required answer is not the number of positions where a valid sequence occurs.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302J - Weird Sanchola

We need to choose one prime number and change every element of the array into that prime. Changing an element by one costs exactly one operation, so if the chosen prime is p, the total cost is f(p)= i=1 ∑ N ∣a i −p∣.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302C - Rectangles

We have at most 2000 distinct points on a coordinate plane. A valid rectangle must use four of these points as its corners, its sides must be horizontal or vertical, and there must be no other given point anywhere inside the rectangle or on one of its four sides.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302G - Left Stack Game

We have three stacks arranged from left to right, containing a, b, and c rocks. On every turn, the current player chooses one nonempty stack and removes between 1 and m rocks.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302F - Drawing cards

There are initially N cards in the box, one card for every label from 1 through N. Whenever a label is drawn for the first time, that card is placed on the desk and one fresh card is added to the box. The label of the fresh card is chosen uniformly from all N possible labels.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302E - Chi's performance

We have (N) performers. Each performer has an instrument ID (V) and an ability value (P). The final order must be sorted by instrument ID. Inside one instrument group, however, we are free to arrange its performers however we want.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302D - Guessing Messages

Samuelo's text is a string s, and Roppa's guessed hidden message is another string t. The guess is considered correct if we can delete some characters from s while keeping the remaining characters in their original order and obtain exactly t.

Practice › Codeforces Solutions › 2019 USP-ICMC ›

CF 102302A - Jumping Buildings

We have a line of (N) buildings, where building (i) has height (hi). Lario starts on one chosen building and makes exactly one jump.