UTPC Contest 1-29-25 Div. 1 (Advanced)

8 problems from UTPC Contest 1-29-25 Div. 1 (Advanced) (contest 105690), difficulty -. 7/8 solutions verified against sample I/O.

8 items

UTPC Contest 1-29-25 Div. 1 (Advanced)

Div. 1 | 8 problems | 7/8 verified | Difficulty - | 5m 59s

# Problem Rating Tags Accepted Time ✓
C Dragon Dance 46s ✓
D Lion Dancers 40s ✓
E Lunar Phases 20s
F Lantern Hopping 41s ✓
G Dragon Scales 38s ✓
H Sally's Stroll (Easy Version) 45s ✓
I Red Envelopes 1m 28s ✓
J Sally's Stroll (Hard Version) 41s ✓
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690I - Red Envelopes

The game contains n envelopes. Envelope i starts with a[i] coins. A move chooses any non-empty group of envelopes that currently contain the same positive number of coins, then removes exactly one coin from every chosen envelope. The player who makes the last possible move wins.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690E - Lunar Phases

I can’t write a correct editorial for this yet because the actual problem statement is missing from your prompt. “Codeforces 105690E - Lunar Phases” isn’t included, and I also don’t have reliable access to its contents from the name alone.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690J - Sally's Stroll (Hard Version)

The grid contains cells that are either usable or blocked. A cell is usable if it contains grass. From a grass cell, Sally can make a move that consists of jumping exactly kv steps vertically or exactly kh steps horizontally, but only if every intermediate cell in that segment…
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690H - Sally's Stroll (Easy Version)

The field is a grid where some cells are available grass cells and the rest are blocked rocks. Sally can jump a fixed distance vertically, kv, or horizontally, kh, but a jump is only allowed when every cell crossed by that jump is grass.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690G - Dragon Scales

We are given a set of horizontal “dragon segments” drawn above a one-dimensional ground line from position 1 to position m. Each dragon occupies a contiguous interval on this line, from li to ri inclusive.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690F - Lantern Hopping

We have a line of lanterns. Lantern i has height a[i], and the dragon starts on one chosen lantern. He can only jump to an adjacent lantern when the two lanterns have the same height at the moment of the jump.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690C - Dragon Dance

We are given a sequence of dancers arranged in a fixed line, where each dancer has a height. From this line, we want to form a subsequence (keeping original order) that will perform in a “dragon dance”.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 1 (Advanced) ›

CF 105690D - Lion Dancers

The corridor is a sequence of columns. Column i contains ki platforms stacked vertically, and all n dancers must stand on distinct platforms in that column.
codeforces competitive-programming Jun 26, 2026