UTPC Contest 03-24-23 Div. 2 (Beginner)

8 problems from UTPC Contest 03-24-23 Div. 2 (Beginner) (contest 104261), difficulty -. 7/8 solutions verified against sample I/O.

8 items

UTPC Contest 03-24-23 Div. 2 (Beginner)

Div. 2 | 8 problems | 7/8 verified | Difficulty - | 9m 57s

#	Problem	Time	✓
A	Planetary Status	56s	✓
B	Pluto Discovery!	1m 11s	✓
C	Calibration Complications	58s	✓
D	Celestial Sky	1m 11s	✓
E	Gluing Pluto Back Together	1m 11s	✓
F	Plutonian Hot Dog Stand	1m 14s	✓
G	Path to Pluto	1m 49s
H	Plantery Observations	1m 27s	✓

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261G - Path to Pluto

We are given a directed weighted graph with $n$ planets and exactly $n-1$ directed roads. Planet $1$ is special and acts as Pluto. From every planet, there exists at least one directed path that reaches Pluto.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261F - Plutonian Hot Dog Stand

We are given a line of people, each with a required threshold value. Mike owns a limited number of discount tickets, and he can assign each ticket to at most one person in the line.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261A - Planetary Status

We are given a single integer $n$, which represents an estimated radius for Pluto in miles. The question is whether this value is large enough for Pluto to qualify as a planet under a specific geometric requirement.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261H - Plantery Observations

We are maintaining a growing string that starts empty and is extended over time. Each update operation appends a new substring to the end, and occasionally we are asked a query about the current full string.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261E - Gluing Pluto Back Together

We are given a complete weighted graph with up to 12 vertices. Each vertex represents a rock fragment, and the cost matrix tells us how expensive it is to directly glue any two fragments together.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261D - Celestial Sky

We are working on a discrete sky represented as integer coordinates in a small grid, specifically points in a 1000 by 1000 space. Two kinds of points are placed on this grid: stars and black holes.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261B - Pluto Discovery!

We are given a single integer $n$, and we need to evaluate a specific summation built from division remainders. For every integer $i$ from 1 to $n$, we divide $n$ by $i$ and take the remainder, then add all those remainders together. The task is to compute this total efficiently.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 2 (Beginner) ›

CF 104261C - Calibration Complications

We are given two arrays of the same length, and we want to transform them so that every element across both arrays becomes equal to a single common value.