2021-2022 ICPC East Central North America Regional Contest (ECNA 2021)
13 problems from 2021-2022 ICPC East Central North America Regional Contest (ECNA 2021) (contest 104196), difficulty -. 13/13 solutions verified against sample I/O.
2021-2022 ICPC East Central North America Regional Contest (ECNA 2021)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 9s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | 1s For All | 1m 1s | ✓ | |||
| B | Abridged Reading | 56s | ✓ | |||
| C | Ball of Whacks | 55s | ✓ | |||
| D | Downsizing | 1m 14s | ✓ | |||
| E | Gambling Game | 1m 12s | ✓ | |||
| F | Growing Some Oobleck | 1m 10s | ✓ | |||
| G | Noonerized Spumbers | 59s | ✓ | |||
| H | Numble | 1m 7s | ✓ | |||
| I | Pinned Files | 44s | ✓ | |||
| J | Recycling | 1m 5s | ✓ | |||
| K | Stable Table | 48s | ✓ | |||
| L | Statues | 58s | ✓ | |||
| M | Tomb Hater | 1m | ✓ |
CF 104196H - Numble
We are given a small crossword-like board where most cells are either empty, already filled with digits, or special bonus cells. We also have a small set of digit tiles in hand.
CF 104196J - Recycling
We are given a sequence of weekly estimates, where each number describes how many cubic meters of recyclable material will arrive in a specific week. We want to place a recycling bin for some contiguous range of weeks and choose its capacity.
CF 104196G - Noonerized Spumbers
We are given a single arithmetic expression containing three integers written as strings, either in the form $x + y = z$ or $x times y = z$.
CF 104196M - Tomb Hater
We are given a rectangular grid of characters, and a list of valid words over the same alphabet. A path starts on any cell in the top row and must end on any cell in the bottom row. Each move goes one step to the South, West, or East, and stepping outside the grid is forbidden.
CF 104196L - Statues
We are given a small grid representing a park. Each cell is either empty water, marked by −1, or contains a statue with a unique positive height. All statues are distinct, so we can think of them as having a strict global order from smallest to largest.
CF 104196K - Stable Table
We are given a rectangular grid made of unit squares, where each cell belongs to exactly one labeled piece. A single piece is a connected set of cells (connected by shared edges), and different pieces can be interwoven, even containing holes formed by other pieces.
CF 104196I - Pinned Files
We are given a list of files, each file having a unique label from 1 to n. At any moment, the editor maintains an ordering of these files, but this ordering is split into two contiguous parts.
CF 104196F - Growing Some Oobleck
We are given a set of circles in the plane. Each circle starts with a fixed center, an initial radius, and a linear growth speed. As time increases, every circle expands outward, so its radius increases linearly.
CF 104196D - Downsizing
We are given a circle centered at a fixed point $O$ with radius $r$, and a convex polygon that lies entirely outside the interior of this circle.
CF 104196E - Gambling Game
We are given a random ordering of the numbers from 1 to m. Think of it as shuffling m distinct tokens and revealing them one by one. Alongside this, we are given a “card” made of n disjoint pairs of numbers.
CF 104196A - 1s For All
The task defines a way to “build” an integer using only the digit one, combined with three operations: addition, multiplication, and digit concatenation.
CF 104196B - Abridged Reading
We are given a collection of chapters where each chapter has a page cost. There are directed dependency relations of the form “chapter a must be read before chapter b”, and each chapter can depend on at most one earlier chapter.