Educational Codeforces Round 139 (Rated for Div. 2)

Solutions for Educational Codeforces Round 139 (Rated for Div. 2) (contest 1766). 1/6 problems verified against sample I/O. Difficulty range: 800-2800.

6 items

Educational Codeforces Round 139 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2800 | Time: 16m 15s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Extremely Round	800	brute-force, implementation	4m 20s	✗
B	Notepad#	1000	implementation	2m 9s	✗
C	Hamiltonian Wall	1300	dp, implementation	2m 48s	✗
D	Lucky Chains	1600	math, number-theory	1m 57s	✓
E	Decomposition	2300	binary-search, brute-force, data-structures	2m 43s	✗
F	MCF	2800	flows	2m 18s	✗

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

CF 1766F - MCF

We are given a directed graph where each edge has a capacity and a cost. We want to push flow from vertex 1 to vertex n, satisfying the usual flow conservation at all intermediate vertices: the total flow into a vertex equals the total flow out.

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

CF 1766E - Decomposition

For any array segment, we process its elements from left to right and maintain a list of subsequences. When a new value arrives, we look for the first subsequence whose current last element has a positive bitwise AND with the new value.

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

CF 1766A - Extremely Round

Input: Expected: Actual: a long list of card distributions So the program is no longer failing with a crash, but producing completely irrelevant output.

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

CF 1766D - Lucky Chains

We are given a list of pairs of positive integers, and for each pair, we want to explore a sequence of consecutive pairs formed by simultaneously incrementing both numbers.

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

CF 1766C - Hamiltonian Wall

We are given a grid with two rows and m columns representing a wall. Each cell is either black (B) or white (W). Monocarp wants to paint all black cells exactly once in a single continuous path that moves only between adjacent cells.

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

CF 1766B - Notepad#

We are asked to type a string s of length n using a text editor that allows two operations: appending a single character or copying a contiguous substring that has already been typed and pasting it at the end.