UTPC Contest 01-27-23 Div. 1 (Advanced)

9 problems from UTPC Contest 01-27-23 Div. 1 (Advanced) (contest 104158), difficulty -. 6/9 solutions verified against sample I/O.

9 items

UTPC Contest 01-27-23 Div. 1 (Advanced)

Div. 1 | 9 problems | 6/9 verified | Difficulty - | 10m 46s

#	Problem	Time	✓
C	Flush-tastic Throwing Challenge	1m 1s	✓
D	Speedy Stamping	1m	✓
E	Brainless Brainstorming	1m 2s	✓
F	Toilet Orders	1m 21s
G	Crappy Typing	1m 9s	✓
H	Crapper's Collapse Catastrophe	1m 27s
I	Drunk Coworker	1m 11s	✓
J	High Jump	1m 8s	✓
K	Office Odyssey	1m 27s

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158K - Office Odyssey

We are given an undirected tree with $n$ nodes, representing office buildings connected by $n-1$ hallways. On this tree, there are $m$ ordered pairs of nodes, and each pair defines a journey that follows the unique simple path between its endpoints.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158J - High Jump

We are given a line of tiles, initially each tile has height 1. Over time, the heights only increase. Each operation selects a contiguous segment and adds the same value to every tile in that segment.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158I - Drunk Coworker

We are given a quadratic curve that models a drunk coworker’s path across a rectangular room. At any horizontal position $x$, the coworker is located at height $f(x)$, where $f$ is a quadratic function.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158H - Crapper's Collapse Catastrophe

We can think of the building as an infinite rooted structure starting from room 0. Each room generates new rooms in the level above it, but the branching factor depends on the parity of the room: even-indexed rooms expand into a rooms, and odd-indexed rooms expand into b rooms.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158F - Toilet Orders

We are given pairs of large integers representing counts of two types of parts, bowls and lids. From each pair, the number of complete toilets Thomas can assemble is determined by the greatest common divisor of these two quantities.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158G - Crappy Typing

We are given a queue of employees, each associated with a fixed typing duration. There are $N$ employees standing in order, and we can place $M$ computers in front of them. At time zero, the first $M$ employees each occupy one computer and start typing.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158E - Brainless Brainstorming

We are given a sequence of $N$ time slots, each slot containing three independent offers: one from Jim, one from Dwight, and one from Kevin. In slot $i$, choosing Jim yields $ai$ ideas, Dwight yields $bi$, and Kevin yields $ci$.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158C - Flush-tastic Throwing Challenge

We are given a circular target on a 2D plane and a set of points representing where employees throw an object. The task is to count how many of these points land inside or exactly on the boundary of the circle. Each throw is just a coordinate on the plane.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 1 (Advanced) ›

CF 104158D - Speedy Stamping

We are given a target string consisting only of the characters T and C. The task is to count how many different ways this string can be formed using a fixed set of stamps. Each position in the string is produced by choosing one of four stamp types.