Codeforces Round 101 (Div. 2)

Solutions for Codeforces Round 101 (Div. 2) (contest 141). 4/5 problems verified against sample I/O. Difficulty range: 800-2300.

5 items

Codeforces Round 101 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 800-2300 | Time: 10m 27s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Amusing Joke	800	implementation, sortings, strings	1m 31s	✓
B	Hopscotch	1400	geometry, math	1m 26s	✓
C	Queue	1800	constructive-algorithms, greedy, sortings	2m 24s	✗
D	Take-off Ramps	2300	graphs, shortest-paths	2m 15s	✓
E	Clearing Up	2300	constructive-algorithms, dp, dsu	2m 51s	✓

Practice › Codeforces Solutions › Codeforces Round 101 (Div. 2) ›

CF 141A - Amusing Joke

We are given three uppercase strings. The first two strings are the names written on the door, and the third string is the pile of letters found the next morning after somebody mixed everything together.

Practice › Codeforces Solutions › Codeforces Round 101 (Div. 2) ›

CF 141B - Hopscotch

We are asked to determine whether a stone thrown onto a hopscotch court lands strictly inside a square, and if so, to identify which square. The court is constructed from squares of side length a, arranged in rows with a repeating 1-1-2-1-2 pattern.

Practice › Codeforces Solutions › Codeforces Round 101 (Div. 2) ›

CF 141C - Queue

Each person remembers a single number, how many taller people stood before them in the queue. We no longer know either the original order or the actual heights. The task is to reconstruct any valid queue order together with heights that satisfy every person's remembered value.

Practice › Codeforces Solutions › Codeforces Round 101 (Div. 2) ›

CF 141D - Take-off Ramps

We are moving on a one-dimensional track from position 0 to position L. Walking is simple, one meter costs exactly one second, and we may move in either direction as long as we never go below 0. A ramp gives a shortcut, but using it has a strict structure.

Practice › Codeforces Solutions › Codeforces Round 101 (Div. 2) ›

CF 141E - Clearing Up

We are given an undirected graph where every edge already belongs to one of two categories. Roads marked "S" are narrow roads that the Elf clears, and roads marked "M" are wide roads that Santa clears. We must choose a subset of roads satisfying two conditions at the same time.