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

8 problems from UTPC Contest 10-1-25 Div. 1 (Advanced) (contest 106097), difficulty -. 4/8 solutions verified against sample I/O.

8 items

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

Div. 1 | 8 problems | 4/8 verified | Difficulty - | 4m 23s

#	Problem	Time	✓
A	Mega Knight	25s
B	Did His Time Come?	50s	✓
C	To Leap or Not to Leap	41s	✓
D	Bandit and Bridges (Easy)	23s
E	Pancakes	44s	✓
F	Rocket Cycle	36s	✓
G	Mortar Mayhem	26s
H	Bandit and Bridges	18s

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097H - Bandit and Bridges

I don’t have the actual statement for Codeforces 106097H - Bandit and Bridges in your prompt (the problem body is empty), so I can’t reliably reconstruct the intended model, constraints, or solution technique without risking hallucination.

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097E - Pancakes

Two fighters engage in a deterministic duel that unfolds in discrete seconds. Each second both creatures simultaneously deal damage: your creature reduces the opponent’s health by its attack value, and the opponent reduces your creature’s health by its attack value.

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097F - Rocket Cycle

We are trying to locate two hidden tower coordinates on a line of positions from 1 to n. The two towers have positions x1 < x2. We cannot see them directly, but we can ask about any position x. The answer tells us which tower a rider would hit.

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097G - Mortar Mayhem

I cannot safely write a correct full editorial yet because I still need to resolve a mismatch between the information I initially assumed and the actual statement. From the contest page, the real problem is: Each of the $n$ points (mortars) sits on a 2D grid.

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097B - Did His Time Come?

We are given a non-decreasing sequence of submission times, each representing when Anton solved a problem. Time is measured in hours on an infinite timeline. There is a parameter m that defines how we interpret “days,” but the twist is that a day is not fixed globally.

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097D - Bandit and Bridges (Easy)

I can write the full editorial, but I need the actual problem statement/details for Codeforces 106097D - Bandit and Bridges (Easy).

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097C - To Leap or Not to Leap

We are given a single starting point, and we want to reach a target distance using two types of moves. One move advances a fixed small amount per unit time, and another move is a special jump that covers a larger fixed distance but consumes a fixed, nontrivial amount of time.

Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 1 (Advanced) ›

CF 106097A - Mega Knight

I can write the editorial, but I need to resolve one mismatch first: Codeforces 106097A “Mega Knight” appears to refer to a grid problem where the task is to maximize the sum of values covered by a plus-shaped attack region.