2023-2024 ICPC East North America Regional Contest (ECNA 2023)

12 problems from 2023-2024 ICPC East North America Regional Contest (ECNA 2023) (contest 104757), difficulty -. 8/12 solutions verified against sample I/O.

12 items

2023-2024 ICPC East North America Regional Contest (ECNA 2023)

ICPC/IOI | 12 problems | 8/12 verified | Difficulty - | 9m 37s

#	Problem	Time	✓
A	A Pivotal Question	46s	✓
B	B Road Band	42s
C	Convex Hull Extension	1m 19s	✓
D	Cornhusker	23s
E	Prof.~Fumblemore and the Collatz Conjecture	1m 14s	✓
F	Double Up	22s
G	Forest for the Trees	1m 2s	✓
H	Impartial Strings	28s
I	ISBN Conversion	33s	✓
J	Pearls	58s	✓
K	Split Decisions	50s	✓
L	A (Fast) Walk in the Woods	1m	✓

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757L - A (Fast) Walk in the Woods

We are given a planar “street graph” embedded on a grid. Each intersection is a vertex with known coordinates, and each road is a straight horizontal or vertical segment between two intersections.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757K - Split Decisions

We are given a collection of words, and we want to understand how pairs of these words can behave like valid “Split Decisions” clues. A valid clue comes from choosing two words of the same length and comparing them position by position.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757J - Pearls

We are asked to embed a fixed sequence of labeled beads into a simple grid walk. Each character in the input string corresponds to one step along a single closed non-self-intersecting path on a rectangular grid.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757I - ISBN Conversion

Each input string represents a candidate ISBN-10 code that may contain digits, hyphens, and possibly the character X as a checksum digit.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757G - Forest for the Trees

We are given a fixed map of tree locations on an integer grid and a second set of observations produced by a robot. The robot does not tell us where it is or which way it is facing, but it reports the relative positions of all trees it can currently see.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757E - Prof.~Fumblemore and the Collatz Conjecture

We are given a short string made of the characters E and O. This string describes the parity behavior of a Collatz sequence until the moment it first reaches a power of two.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757H - Impartial Strings

Working

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757F - Double Up

Working

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757C - Convex Hull Extension

We are given a convex polygon already in its final form, described by its vertices in counterclockwise order. There are no degeneracies: the polygon is strictly convex and every vertex is a genuine corner.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757D - Cornhusker

We are simulating a simplified agricultural estimation process for corn yield. The input describes five sampled corn ears, where each ear is characterized by two measurements: how many kernels wrap around the ear and how many kernels run along its length.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757A - A Pivotal Question

We are given a sequence of distinct positive integers, and we want to decide whether this sequence could be the result of a single partition step in quicksort, using some unknown pivot value that already appears in the array.

Practice › Codeforces Solutions › 2023-2024 ICPC East North America Regional Contest (ECNA 2023) ›

CF 104757B - B Road Band

We are given two sets of customer locations, each set lying on a separate straight road. The roads are parallel, and there is a fixed vertical separation between them.