ICPC 2021-2022 NERC (NEERC), Southern and Volga Russia Qualifier
13 problems from ICPC 2021-2022 NERC (NEERC), Southern and Volga Russia Qualifier (contest 104015), difficulty -. 11/13 solutions verified against sample I/O.
ICPC 2021-2022 NERC (NEERC), Southern and Volga Russia Qualifier
ICPC/IOI | 13 problems | 11/13 verified | Difficulty - | 13m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Candies | 40s | ✓ | |||
| B | Computer Game | 44s | ✓ | |||
| C | Groups | 2m 5s | ||||
| D | Rectangle Restoration | 42s | ✓ | |||
| E | Delete Two Elements | 43s | ✓ | |||
| F | Coconuts | 48s | ✓ | |||
| G | Training Session | 42s | ✓ | |||
| H | Colored Balls | 1m 10s | ✓ | |||
| I | Tree Painting | 1m 58s | ||||
| J | Replacing Letters | 1m | ✓ | |||
| K | Staircases | 48s | ✓ | |||
| L | RBS | 1m | ✓ | |||
| M | The Sum of Good Numbers | 40s | ✓ |
CF 104015M - The Sum of Good Numbers
We are given a long digit string s that was formed by taking an array of positive integers and concatenating them without separators. Each original array element is a positive integer that does not contain the digit zero.
CF 104015I - Tree Painting
Let $F$ denote the family of 5757 SGB words represented on variables $a1,dots,z5$ as in (131), and let the associated ZDD be constructed in the standard ordered way with variables processed in lexicographic order.
CF 104015L - RBS
We are given several strings, each consisting only of opening and closing brackets. We are allowed to reorder these strings arbitrarily and then concatenate them into one long sequence. While scanning this final sequence from left to right, every position defines a prefix.
CF 104015K - Staircases
We are working on an $n times m$ grid where each cell is either usable or blocked, and the grid changes over time as we toggle individual cells. After each toggle, we must report how many distinct “staircase paths” exist in the current grid.
CF 104015H - Colored Balls
We are given three piles of balls, each pile having a different color. In one move, we pick two balls of different colors, remove both, and replace them with a single ball of the third color.
CF 104015J - Replacing Letters
We are given a string of lowercase English letters. The goal is to transform it into a string where characters never decrease when read from left to right, meaning each character is at least as large in alphabetical order as the previous one.
CF 104015F - Coconuts
We are given a sequence of piles of coconuts, where each pile has some integer size. We are allowed to choose a single positive integer base value $x$, and then we only collect coconuts from those piles whose size is an exact positive power of $x$, meaning values of the form…
CF 104015G - Training Session
We are given a collection of problems, where each problem is described by two attributes: a topic label and a difficulty value.
CF 104015C - Groups
Let $F$ denote the family of 5757 SGB words represented on variables $a1,dots,z5$ as in (131), and let the associated ZDD be constructed in the standard ordered way with variables processed in lexicographic order.
CF 104015E - Delete Two Elements
We are given an array of integers and we first compute its average value, which is the total sum divided by the number of elements. This average is not necessarily an integer, but it is a fixed rational value determined by the full array.
CF 104015D - Rectangle Restoration
We are dealing with a rectangle with unknown side lengths, say $a$ and $b$, both strictly positive real numbers. We are not given the rectangle directly. Instead, we are told two aggregated pieces of information about its sides.
CF 104015B - Computer Game
We are given a very small game board with exactly two rows and $n$ columns. A player starts at the top-left cell and wants to reach the bottom-right cell. Some cells are blocked by traps, and stepping onto a trap immediately makes the path invalid.
CF 104015A - Candies
We are given a fixed number of candies and a school split into two groups of students: boys and girls. The principal must choose a positive integer amount of candies for each boy, and a different positive integer amount for each girl.