2023-2024 ICPC, NERC, Southern and Volga Russian Regional Contest (problems intersect with Educational Codeforces Round 157)
14 problems from 2023-2024 ICPC, NERC, Southern and Volga Russian Regional Contest (problems intersect with Educational Codeforces Round 157) (contest 104777), difficulty -. 14/14 solutions verified against sample I/O.
2023-2024 ICPC, NERC, Southern and Volga Russian Regional Contest (problems intersect with Educational Codeforces Round 157)
Educational | 14 problems | 14/14 verified | Difficulty - | 12m 31s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Security | 46s | ✓ | |||
| B | Two Characters, Two Colors | 1m 22s | ✓ | |||
| C | Broken Robot | 52s | ✓ | |||
| D | Infinite Card Game | 54s | ✓ | |||
| E | Pins and Jumpers | 51s | ✓ | |||
| F | Conflict of Interest | 53s | ✓ | |||
| G | Torn Lucky Ticket | 50s | ✓ | |||
| H | Fancy Arrays | 1m | ✓ | |||
| I | Points and Minimum Distance | 49s | ✓ | |||
| J | Complete the Permutation | 47s | ✓ | |||
| K | Financial Discipline | 55s | ✓ | |||
| L | Computer Games | 51s | ✓ | |||
| M | Treasure Chest | 57s | ✓ | |||
| N | XOR Construction | 44s | ✓ |
CF 104777N - XOR Construction
We are given a sequence of XOR differences between consecutive elements of a hidden permutation. More concretely, there is a permutation of all integers from 0 to n − 1, and instead of the permutation itself, we are told the XOR between each adjacent pair.
CF 104777M - Treasure Chest
We are working on a one-dimensional line of integer coordinates. Monocarp starts at position 0. There is a key at position y and a treasure chest at position x.
CF 104777L - Computer Games
We are given a collection of games, each game having a storage cost and a rating. We want to pick a subset of these games to install on a computer with a limited total storage capacity. The subset must contain at least k games and the sum of their sizes must not exceed m.
CF 104777K - Financial Discipline
We are simulating a very specific financial process repeated over a fixed number of days. A person starts with zero coins.
CF 104777J - Complete the Permutation
We are given an array of length $2n-1$ where all odd positions are already fixed and contain all odd numbers from $1$ to $2n-1$. The even positions are empty, and we must fill them using all even numbers from $2$ to $2n-2$, each exactly once.
CF 104777I - Points and Minimum Distance
We are given an array of 2n integers, and our task is to turn these numbers into n geometric points in the plane.
CF 104777H - Fancy Arrays
We are counting arrays of length n where each element is a non-negative integer, but not arbitrary arrays. Two restrictions shape what is allowed.
CF 104777G - Torn Lucky Ticket
We are given a collection of short digit strings, each representing a “ticket fragment”. We are allowed to concatenate any two fragments, in order, forming a longer ticket.
CF 104777F - Conflict of Interest
We are given a long sequence of food packs that are initially arranged in a fixed order. These packs are consumed two per day, in consecutive pairs, so day 1 uses positions 1 and 2, day 2 uses positions 3 and 4, and so on.
CF 104777E - Pins and Jumpers
We are simulating a sequential installation process of interval “jumpers” on a line of pins indexed from 1 to n. Each jumper covers a contiguous segment [l, r]. The robot processes jumpers in order.
CF 104777D - Infinite Card Game
Each card in this game is defined by two numbers: how strong it is when attacking and how hard it is to beat when defending. A card s can defeat another card t if and only if s.attack t.defence.
CF 104777B - Two Characters, Two Colors
We are given a binary string and, for every position, two alternative “modes”. If we assign the position red, we gain a value $ri$. If we assign it blue, we gain $bi$.
CF 104777C - Broken Robot
We are simulating a robot that starts at the origin on an infinite grid and must visit a sequence of points in order.
CF 104777A - Security
We are given multiple independent test cases. In each one, there is an existing password string and a target length for a new password.