2023 UCF Local Programming Contest

12 problems from 2023 UCF Local Programming Contest (contest 106369), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2023 UCF Local Programming Contest

Special | 12 problems | 12/12 verified | Difficulty - | 9m 21s

#	Problem	Time	✓
A	Lucky 7	45s	✓
B	We Want You Happy!	44s	✓
C	Snailography	56s	✓
D	Good Goalie	46s	✓
E	Most Valuable Pez	38s	✓
F	Land Division	48s	✓
G	Not So Close	37s	✓
H	The Duel of Smokin' Joe	50s	✓
I	Drake Robbing	45s	✓
J	Grow Measure Cut Repeat	52s	✓
K	Bad Bunny	31s	✓
L	Rope Without Knots	1m 9s	✓

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369L - Rope Without Knots

We are given a set of points in the plane, called pins. We must output a closed polyline path, meaning a sequence of points that starts and ends at the same coordinate. The path has two topological requirements.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369J - Grow Measure Cut Repeat

The input describes a sequence of commands applied to an initially flat terrain indexed by integers. A grow operation centered at position L with strength K increases the height of position x by max(0, K minus distance between x and L).

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369K - Bad Bunny

The provided statement does not include the actual rules of the problem. Apart from the title and a few unrelated words like “Hard” and “rope”, there is no description of what the input represents, what transformations or queries are involved, or what must be computed in…

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369C - Snailography

The task describes a small system that evolves step by step on a row of positions, where each position initially holds some integer value representing a stack size. The row behaves like a sequence that is repeatedly modified by local interactions between adjacent elements.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369H - The Duel of Smokin' Joe

The game starts with a permutation of the numbers from 1 to n. Two players repeatedly choose two positions that are not already correct and swap the values in those positions. A value that reaches its own position becomes locked and cannot participate in later swaps.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369F - Land Division

The input describes a tree with n nodes. Each query provides two disjoint subsets of nodes, one marked red and one marked blue.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369I - Drake Robbing

We have a square picture represented as an N × N grid. Every cell is either empty or contains one object: a sun, house, chupacabra, slope, bird, drake, or grill.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369G - Not So Close

The problem asks us to place condo units on an r by c rectangular grid. A condo occupies one grid square, and two condos are not allowed to be placed in squares that touch each other. Touching includes all eight directions: horizontal, vertical, and diagonal neighbors.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369E - Most Valuable Pez

The problem models a collection of Pez dispensers. Each dispenser contains exactly 12 candies arranged from the top to the bottom, and a dispenser can only be eaten from the top.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369B - We Want You Happy!

The task, as stated, provides no meaningful structured input and expects a corresponding output that reflects the intent of the problem name.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369D - Good Goalie

The problem describes a goalkeeping scenario where we are implicitly evaluating how “good” a goalkeeper is under a specific scoring rule applied to a set of situations.

Practice › Codeforces Solutions › 2023 UCF Local Programming Contest ›

CF 106369A - Lucky 7

The task is built around a simple “lucky digit” check on a given number written as a sequence of characters. You receive one or more inputs, each representing a number in its textual form, and you must decide whether that number qualifies as “lucky” according to a single…