Codeforces Round 127 (Div. 1)

5 problems from Codeforces Round 127 (Div. 1) (contest 201), difficulty 1700-2600. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 127 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1700-2600 | 7m 7s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Clear Symmetry	1700	constructive-algorithms, dp, math	3,246	1m 9s	✓
B	Guess That Car!	1800	math, ternary-search	1,391	1m	✓
C	Fragile Bridges	2000	dp	1,513	1m 40s	✓
D	Brand New Problem	2600	bitmasks, brute-force, dp	454	1m 39s	✓
E	Thoroughly Bureaucratic Organization	2600	binary-search, combinatorics	483	1m 39s

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201A - Clear Symmetry

We are asked to construct a square matrix of size n × n, filled with zeros and ones, that satisfies two properties: it must be clear, meaning that no two ones are adjacent horizontally or vertically, and it must be symmetrical along both the horizontal and vertical axes.

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201B - Guess That Car!

The problem places us in a grid-like parking lot of size 4·n by 4·m meters, divided into squares of 4 by 4 meters, each containing a car with a known "rarity" value.

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201C - Fragile Bridges

We have a path graph with n platforms and n - 1 bridges between consecutive platforms. Bridge i connects platform i and i + 1, and can be crossed exactly a[i] times before disappearing permanently.

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201D - Brand New Problem

Lesha has a problem description made of n distinct words, written in a fixed order. Each archive problem is another sequence of words, but archive descriptions may repeat words many times. We want to compare Lesha’s description against every archive description.

Practice › Codeforces Solutions › Codeforces Round 127 (Div. 1) ›

CF 201E - Thoroughly Bureaucratic Organization

The problem involves a set of people, each with an appointment on a unique day in the next n days. You do not know who is scheduled on which day, but you can query the organization in forms that list up to m names.