Codeforces Round 134 (Div. 1)

Solutions for Codeforces Round 134 (Div. 1) (contest 217). 3/4 problems verified against sample I/O. Difficulty range: 1200-2900.

4 items

Codeforces Round 134 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1200-2900 | Time: 12m 51s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Ice Skating	1200	brute-force, dfs-and-similar, dsu	1m 15s	✓
C	Formurosa	2600	divide-and-conquer, dp, expression-parsing	1m 20s	✓
D	Bitonix' Patrol	2900	bitmasks, brute-force, combinatorics	3m 51s	✗
E	Alien DNA	2800	data-structures, dsu, trees	6m 25s	✓

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

CF 217A - Ice Skating

We are given a set of snow drifts on a 2D grid. Bajtek can move from one snow drift to another by sliding along the rows or columns until he reaches another snow drift, moving strictly in the north, south, east, or west directions.

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

CF 217C - Formurosa

We are given a Boolean formula consisting of constants 0 and 1, unknown variables denoted by ?, and the logical operators AND (&), OR ( The task is to determine whether it is always possible to uniquely identify the species of each colony, no matter how the unknowns are…

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

CF 217D - Bitonix' Patrol

The orbit contains n stations placed uniformly on a circle. Adjacent stations are exactly m miles apart, so the whole circumference equals n m.

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

CF 217E - Alien DNA

The problem presents a sequence of DNA letters and a series of mutations that sequentially expand the sequence. Each mutation activates a contiguous subsequence, duplicates it, and mangles the copy in a specific way: all letters at even positions come first, followed by all…