Educational Codeforces Round 101 (Rated for Div. 2)

Solutions for Educational Codeforces Round 101 (Rated for Div. 2) (contest 1469). 4/6 problems verified against sample I/O. Difficulty range: 1000-2600.

6 items

Educational Codeforces Round 101 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 1000-2600 | Time: 22m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Regular Bracket Sequence	1000	constructive-algorithms, greedy	2m 14s	✗
B	Red and Blue	1000	dp, greedy	1m 50s	✓
C	Building a Fence	1600	dp, greedy, implementation	1m 59s	✓
D	Ceil Divisions	1700	brute-force, constructive-algorithms, math	5m	✗
E	A Bit Similar	2400	bitmasks, brute-force, hashing	10m 7s	✓
F	Power Sockets	2600	binary-search, data-structures, greedy	1m 47s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 101 (Rated for Div. 2) ›

CF 1469E - A Bit Similar

We are asked to find a binary string of length k that is "bit similar" to every substring of length k in a given binary string s of length n. Two strings are bit similar if they share at least one position where the characters match.

Practice › Codeforces Solutions › Educational Codeforces Round 101 (Rated for Div. 2) ›

CF 1469D - Ceil Divisions

We are given an array of integers from 1 to $n$, so $ai = i$. The allowed operation is to select two distinct indices $x$ and $y$ and replace $ax$ with the ceiling of $ax / ay$. The goal is to transform this array so that exactly one element equals 2 and the rest are all 1s.

Practice › Codeforces Solutions › Educational Codeforces Round 101 (Rated for Div. 2) ›

CF 1469F - Power Sockets

We are given several linear chains, each of which is just a simple path graph. From these chains we are allowed to attach some of them onto a growing tree that starts from a single white root vertex.

Practice › Codeforces Solutions › Educational Codeforces Round 101 (Rated for Div. 2) ›

CF 1469A - Regular Bracket Sequence

We are given a short string made only of three kinds of characters: opening brackets, closing brackets, and question marks. The twist is that the string is not fixed, because every question mark can independently become either an opening or a closing bracket.

Practice › Codeforces Solutions › Educational Codeforces Round 101 (Rated for Div. 2) ›

CF 1469C - Building a Fence

We are asked to place a sequence of fence sections on uneven ground. Each section has width 1 and a fixed height k. The ground under section i has height hi.

Practice › Codeforces Solutions › Educational Codeforces Round 101 (Rated for Div. 2) ›

CF 1469B - Red and Blue

We are given two sequences of integers, one representing red-painted elements and the other representing blue-painted elements of an original sequence.