ICPC 2020-2021 NERC (NEERC), Southern and Volga Russia Qualifier
12 problems from ICPC 2020-2021 NERC (NEERC), Southern and Volga Russia Qualifier (contest 102791), difficulty -. 8/12 solutions verified against sample I/O.
ICPC 2020-2021 NERC (NEERC), Southern and Volga Russia Qualifier
ICPC/IOI | 12 problems | 8/12 verified | Difficulty - | 11m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Christmas Ornaments | 41s | ||||
| B | Look At The Same One | 30s | ||||
| C | Number of Apartments | 33s | ||||
| D | Barrels | 1m 2s | ✓ | |||
| E | Numbers on Whiteboard | 1m 18s | ✓ | |||
| F | Deposit | 30s | ||||
| G | Parking Spaces | 1m 10s | ✓ | |||
| H | String Deletion | 1m | ✓ | |||
| I | String Reversal | 1m 7s | ✓ | |||
| J | Divide The String | 1m 4s | ✓ | |||
| K | Realistic Gameplay | 1m 5s | ✓ | |||
| L | Yet Another DAG Problem | 1m | ✓ |
CF 102791B - Look At The Same One
I can absolutely write a full Codeforces editorial in that format, but I don't have the actual problem statement for Codeforces 102791B - Look At The Same One.
CF 102791C - Number of Apartments
I can absolutely write that editorial, but I need the actual problem statement (or at least enough details to reconstruct it).
CF 102791F - Deposit
I can't write a correct editorial for this problem because the prompt does not include the actual problem statement. The sections for "Problem Statement", "Input", and "Output" are empty, and "Codeforces 102791F - Deposit" is not enough to reconstruct the task reliably.
CF 102791A - Christmas Ornaments
I don't have the actual problem statement for Codeforces 102791A "Christmas Ornaments". The prompt you provided has empty sections for the statement, input, and output, so I don't know what the task is asking or what algorithm is required.
CF 102791L - Yet Another DAG Problem
We have a directed acyclic graph. Every edge goes from a vertex with a larger assigned value to a vertex with a smaller assigned value. If an edge goes from x to y, its contribution is w (a[x] - a[y]).
CF 102791K - Realistic Gameplay
We have a gun with a magazine that can hold k bullets. There are n independent monster waves. A wave appears at time li, contains ai monsters, and all monsters from that wave must be killed no later than time ri.
CF 102791J - Divide The String
We have a string of lowercase letters. We need to cut it into consecutive pieces so that every piece has length at least two and the first and last characters of that piece are the same. Every character must belong to exactly one piece.
CF 102791I - String Reversal
The task is to find the minimum number of adjacent swaps needed to turn a given string into its reverse. A swap can only exchange two neighboring characters, so the cost measures how far characters have to travel through the string.
CF 102791H - String Deletion
The task gives a binary string. An operation chooses one existing character and removes it. After that removal, the longest prefix made of identical characters is also removed automatically.
CF 102791G - Parking Spaces
The parking spaces are numbered from left to right, but the owner refuses to use one particular digit k. Starting from the integer 1, every number containing that digit is ignored, and the next valid integer is assigned instead.
CF 102791E - Numbers on Whiteboard
The board starts with every integer from 1 to n written exactly once. An operation removes two existing numbers a and b and replaces them with the ceiling of their average. After repeating this exactly n - 1 times, only one number remains.
CF 102791D - Barrels
We have a row of barrels, and each barrel starts with some amount of water. A move consists of choosing one non-empty barrel and pouring any amount of its water into another barrel. We can perform at most k moves.