UTPC Contest 10-09-20 Div. 1

7 problems from UTPC Contest 10-09-20 Div. 1 (contest 102756), difficulty -. 7/7 solutions verified against sample I/O.

7 items

UTPC Contest 10-09-20 Div. 1

Div. 1 | 7 problems | 7/7 verified | Difficulty - | 7m 23s

#	Problem	Time	✓
D	Best Thing Since Sliced Bread	1m 14s	✓
E	Hieroglyph Sequences	59s	✓
F	Maze Design	46s	✓
G	Locked Out	1m 3s	✓
H	Voyager	1m 6s	✓
I	Space and Time and Music	1m 15s	✓
J	Majestic Warriors of China	1m	✓

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756F - Maze Design

The maze is a corridor with exactly three rows and n columns. Each character describes one tile. A 0 tile is a place Alice can stand on, while a 1 tile is blocked.

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756E - Hieroglyph Sequences

The problem describes a sequence of hieroglyph values. Each value is represented by an integer, and the king accepts only sequences where the XOR of all values is zero.

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756J - Majestic Warriors of China

We have a line of $N$ statues. Each statue is described by a $K$-bit number, where bit $i$ tells whether feature $i$ appears on that statue. A consecutive group of statues is called majestic when every feature appears the same number of times inside that group.

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756I - Space and Time and Music

The problem describes a music system with N instruments. Each instrument can produce a certain number of different notes, and the guidebook describes which instruments are allowed to come after which others. A melody is a sequence of exactly K notes.

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756H - Voyager

The problem models a voyage between islands. Each island has a position on a 2D plane and a number of supplies. The starting island is the first one, and the destination is the last one.

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756G - Locked Out

The problem asks us to recover a forgotten password from several recovery codes. Each code has exactly k digits, but every code has been affected by the same unknown rearrangement of digit positions.

Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 1 ›

CF 102756D - Best Thing Since Sliced Bread

The problem asks us to examine a collection of historical inventions. Each invention has a name, an invention date, and a score representing how great it is compared with sliced bread.