2022-2023 ICPC East Central North America Regional Contest (ECNA 2022)
12 problems from 2022-2023 ICPC East Central North America Regional Contest (ECNA 2022) (contest 104614), difficulty -. 12/12 solutions verified against sample I/O.
2022-2023 ICPC East Central North America Regional Contest (ECNA 2022)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 12m 21s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | A-Mazing Puzzle | 1m 13s | ✓ | |||
| B | A Musical Question | 54s | ✓ | |||
| C | Cribbage On Steroids | 1m 9s | ✓ | |||
| D | Determining Nucleotide Assortments | 1m 13s | ✓ | |||
| E | Hilbert's Hedge Maze | 51s | ✓ | |||
| F | It's About Time | 57s | ✓ | |||
| G | Pea Pattern | 53s | ✓ | |||
| H | Picking Up Steam | 1m 14s | ✓ | |||
| I | Road To Savings | 1m 10s | ✓ | |||
| J | Simple Solitaire | 52s | ✓ | |||
| K | Two Charts Become One | 1m | ✓ | |||
| L | Which Warehouse? | 55s | ✓ |
CF 104614D - Determining Nucleotide Assortments
We are given a DNA strand consisting only of the four nucleotide types A, T, G, and C. After the strand, several range queries follow. Each query specifies a contiguous section of the strand, and for that section we must determine how frequently each nucleotide appears.
CF 104614L - Which Warehouse?
We are given a set of warehouses connected by directed roads with travel costs. Each warehouse initially stores quantities of several product types.
CF 104614K - Two Charts Become One
We are given two textual descriptions of rooted hierarchical structures. Each structure defines departments labeled by integers, where every department may have several direct subdepartments.
CF 104614J - Simple Solitaire
We are given a fixed sequence of 52 playing cards, read in the exact order they are revealed. We simulate a process where cards are turned face up one by one and placed into a growing sequence.
CF 104614I - Road To Savings
The city is modeled as an undirected weighted graph. Each intersection is a vertex and each road is an edge whose weight is its length.
CF 104614H - Picking Up Steam
We are given a terrain described by a polyline that is monotone in x, so it is a chain of straight segments from left to right. A camera sits at a fixed point on this terrain, at a specified x-coordinate, meaning its y-coordinate is determined by the terrain at that x.
CF 104614G - Pea Pattern
We are given two very large integers written as digit strings. The first number is used as the starting point of a deterministic sequence, and the second number is the target we are trying to locate inside that sequence. The sequence evolves in a very specific way.
CF 104614F - It's About Time
We are asked to design a simplified “leap-year system” for a fictional planet whose year length is not exactly an integer number of local days. From physics, the input gives enough information to compute how long the planet takes to complete one orbit around its star.
CF 104614E - Hilbert's Hedge Maze
The maze is not given explicitly. Instead, it is generated by repeatedly expanding a symbolic string that behaves like a growing fractal instruction system.
CF 104614A - A-Mazing Puzzle
We are given a rectangular maze and two robots placed on different cells with initial directions. The maze is a grid where movement is blocked by internal walls and the outer boundary, except for a single exit located on the southern border of one specific cell.
CF 104614C - Cribbage On Steroids
We are given a multiset of cards, each card described only by its rank. Suits do not matter. The task is to compute a single score based on three independent scoring rules applied over the entire collection, not just five cards.
CF 104614B - A Musical Question
We are given a fixed capacity for two identical CDs and a list of song durations. Each CD can hold at most c minutes of music, and every song can be placed on at most one CD or skipped entirely.