Codeforces Round 546 (Div. 2)

Solutions for Codeforces Round 546 (Div. 2) (contest 1136). 5/5 problems verified against sample I/O. Difficulty range: 800-2200.

5 items

Codeforces Round 546 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2200 | Time: 8m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Nastya Is Reading a Book	800	implementation	1m 18s	✓
B	Nastya Is Playing Computer Games	1000	constructive-algorithms, math	2m	✓
C	Nastya Is Transposing Matrices	1500	constructive-algorithms, sortings	1m 49s	✓
D	Nastya Is Buying Lunch	1800	greedy	1m 26s	✓
E	Nastya Hasn't Written a Legend	2200	binary-search, data-structures	2m	✓

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

CF 1136E - Nastya Hasn't Written a Legend

We have an array a and another array k. The array always satisfies a monotonic-type constraint: $$a{i+1} ge ai + ki$$ for every adjacent pair. There are two operations. The first operation increases one position a[i] by some value x.

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

CF 1136D - Nastya Is Buying Lunch

The queue is fixed initially, and the last person in the queue is Nastya. Some ordered pairs $(u,v)$ are given. A pair means that whenever pupil $u$ stands immediately in front of pupil $v$, those two pupils are willing to swap places.

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

CF 1136B - Nastya Is Playing Computer Games

There are n manholes arranged in a line. Each manhole initially contains exactly one stone on top of it and one coin underneath it. Nastya starts at manhole k. A coin can only be collected when the current manhole has no stones on it.

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

CF 1136C - Nastya Is Transposing Matrices

We are given two matrices of the same size, A and B. The allowed operation is surprisingly powerful: we may choose any square submatrix inside A and transpose it. Transposition swaps positions relative to the square's main diagonal.

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

CF 1136A - Nastya Is Reading a Book

The book is divided into consecutive chapters. Each chapter occupies a continuous range of pages, and every page belongs to exactly one chapter. Nastya has already read pages 1 through k - 1. Page k is the first page she has not read yet.