Codeforces Beta Round 97 (Div. 1)

Solutions for Codeforces Beta Round 97 (Div. 1) (contest 135). 5/5 problems verified against sample I/O. Difficulty range: 1300-3000.

5 items

Codeforces Beta Round 97 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1300-3000 | Time: 9m 14s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Replacement	1300	greedy, implementation, sortings	1m 34s	✓
B	Rectangle and Square	1600	brute-force, geometry, math	2m 3s	✓
C	Zero-One	1900	constructive-algorithms, games, greedy	1m 50s	✓
D	Cycle	2500	brute-force, dfs-and-similar, implementation	1m 50s	✓
E	Weak Subsequence	3000	combinatorics	1m 57s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 1) ›

CF 135A - Replacement

We start with an array of positive integers. We must change exactly one element to a different value, still between 1 and 10^9. After that single replacement, we sort the array in non-decreasing order.

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 1) ›

CF 135B - Rectangle and Square

We are given eight distinct points on the plane. The task is to split them into two disjoint groups of four points each. One group must form a square. The other group must form a rectangle.

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 1) ›

CF 135C - Zero-One

We are given a string consisting of 0, 1, and ?. Each character represents a card in a row. During the game, players alternately remove one card until only two cards remain.

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 1) ›

CF 135D - Cycle

We are given a binary grid. Cells containing '1' form usable tiles, while '0' cells are blocked. We want the longest cycle made entirely from '1' cells. The cycle must behave like a simple closed curve on the grid.

Practice › Codeforces Solutions › Codeforces Beta Round 97 (Div. 1) ›

CF 135E - Weak Subsequence

We are looking at finite strings over an alphabet of size k. For every such string, define a special value: Take all substrings of the string. Among them, some substrings can also appear as a subsequence in a non-contiguous way.