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

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

8 items

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

Div. 1 | 8 problems | 1/8 verified | Difficulty - | 10m 17s

#	Problem	Time	✓
C	Wordy Painting	1m 24s
D	By the pricking of my thumbs, Pupil #1 this way comes	30s
E	Book Rewriting	1m 30s
F	Word Inventing	1m 31s	✓
G	As I end the Refrain	1m 27s
H	Stringliloquy	1m 18s
I	Plays align, grand schedule design	1m 20s
J	Let's talk of graves, of worms, and epitaphs	1m 17s

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

CF 105049J - Let's talk of graves, of worms, and epitaphs

We are working with a directed graph whose nodes represent themes and whose edges represent one-way relationships between them.

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

CF 105049I - Plays align, grand schedule design

We are arranging all integers from 1 to n into a permutation, where each integer represents a play and its value represents how good it is. Small numbers are better plays and large numbers are worse plays.

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

CF 105049H - Stringliloquy

We are given a long string that represents a text written as a sequence of uppercase letters. Alongside this text, we are given a collection of dictionary words.

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

CF 105049G - As I end the Refrain

We are given two collections of points on a number line. The first collection consists of bakeries with positions $x1, x2, dots, xN$.

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

CF 105049E - Book Rewriting

We are given a fixed set of distinct “unknown words” that William encounters while rewriting a collection of sentences.

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

CF 105049F - Word Inventing

We are given a string of length $n$. The only allowed operation is to pick an index $i$ and swap the characters at positions $i$ and $i+k$. This operation can be repeated arbitrarily many times.

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

CF 105049C - Wordy Painting

We are maintaining a grid of stacks. Each cell of an $N times N$ board contains a vertical stack of letters. The system supports three kinds of operations applied over time: pushing a letter onto a stack, popping the top letter from a stack, and querying whether a given letter…

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

CF 105049D - By the pricking of my thumbs, Pupil #1 this way comes

Working