UTPC Contest 03-24-23 Div. 1 (Advanced)

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

8 items

UTPC Contest 03-24-23 Div. 1 (Advanced)

Div. 1 | 8 problems | 2/8 verified | Difficulty - | 12m 15s

#	Problem	Time	✓
C	Calibration Complications	1m 2s
D	Celestial Sky	1m 15s	✓
E	Gluing Pluto Back Together	1m 26s	✓
F	Plutonian Hot Dog Stand	2m 4s
G	Path to Pluto	1m 36s
H	Plantery Observations	1m 40s
I	Wormholes	1m 29s
J	Rocket Fuel	1m 43s

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262J - Rocket Fuel

We are given a system with $n$ engines, each holding a fuel requirement that changes over time. At the beginning, every engine $i$ has an initial fuel requirement $f{1,i}$. After that, there are $m$ events.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262I - Wormholes

The world is a directed graph where planets are nodes and wormholes are directed edges with a damage cost. Meryl and Roberto both start at planet 1 and must independently reach planet n.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262F - Plutonian Hot Dog Stand

Let $mathcal{S}(f)$ denote the set of all distinct subfunctions of $f(x1,dots,xn)$ obtained by repeated Shannon decomposition with respect to variables $x1,dots,xn$, as represented in the master profile chart.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262H - Plantery Observations

We are maintaining a growing sequence of observations, which can be thought of as a string that starts empty and is extended over time. Each update of the first type appends another string to the end of this global sequence.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262G - Path to Pluto

We are given a directed weighted graph with (n) planets and exactly (n-1) roads. Each road has a direction and a travel cost. Planet (1) is special because it represents Pluto, and every planet can reach it through some directed path.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262E - Gluing Pluto Back Together

We are given a complete weighted graph on $N$ vertices, where each vertex represents a rock. The cost $C{i,j}$ is the price of directly gluing rock $i$ next to rock $j$.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262D - Celestial Sky

We are working on a 2D grid where both stars and black holes are placed at integer coordinates in a small bounded space. Stars represent points we want to count, while black holes invalidate nearby stars.

Practice › Codeforces Solutions › UTPC Contest 03-24-23 Div. 1 (Advanced) ›

CF 104262C - Calibration Complications

The five-letter word pairing scheme in Section 7.2.1.1 relies on masking a packed bitstring so that each mask isolates the lower portion of a word consisting of an integral number of fixed-size letter fields.