UTPC Contest 09-13-24 Div. 1 (Advanced)

8 problems from UTPC Contest 09-13-24 Div. 1 (Advanced) (contest 105345), difficulty -. 0/8 solutions verified against sample I/O.

8 items

UTPC Contest 09-13-24 Div. 1 (Advanced)

Div. 1 | 8 problems | 0/8 verified | Difficulty - | 16m 54s

#	Problem	Time
C	Spooky Hallway	5m 14s
D	Nightmare on 24th	1m 15s
E	Candy Eating	1m 31s
F	Haunted House	1m 35s
G	Pumpkin Patch	1m 27s
H	Speedway Evacuation	1m 20s
I	Trick or Treat	1m 25s
J	Phantom Poker	3m 7s

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345C - Spooky Hallway

We are given a binary string representing a row of lanterns, where each position is either 0 or 1. In a single operation, we choose any contiguous segment and flip every bit inside it, turning 0 into 1 and 1 into 0.

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345I - Trick or Treat

We are given a line of houses arranged in a row. Each house has a deadline, measured in minutes from the start, after which Alice can still reach it but will not receive candy if she arrives exactly at that time or later.

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345G - Pumpkin Patch

The maze is a small grid where each cell behaves like a terrain type that affects how Sam can move. Some cells are freely passable, some are blocked, and some impose a resource constraint: Sam may need to collect candy corns to pass through certain obstacles.

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345H - Speedway Evacuation

We are given a line segment of integer positions from 0 to n. Several students initially occupy positions between 1 and n−1. Each student independently chooses a direction, left toward 0 or right toward n, each with probability 1/2.

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345F - Haunted House

The task is to determine which exit rooms in a building are safe for Harry to reach given that ghosts are also moving through the same building at the same speed. We can view the house as an undirected graph where rooms are nodes and doors are edges.

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345E - Candy Eating

We are given several types of candy, where each type has a limited supply and a fixed tastiness per piece. Charlie can eat candy over a limited number of days, but each day comes with two constraints: he cannot exceed a fixed number of candies per day, and he is not allowed to…

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345J - Phantom Poker

We are given an array of $n$ cards laid out in a line, where each card carries a value from 1 to 13. Over time, the values change through updates, and we are also asked to answer range queries. A query of the first type changes a single position in the array to a new value.

Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 1 (Advanced) ›

CF 105345D - Nightmare on 24th

We are given a line of buildings, each containing some number of students. Freddy always starts from the first building and moves strictly to the right. As he visits buildings in order, he accumulates the number of students he has seen so far.