Codeforces Round 511 (Div. 1)

5 problems from Codeforces Round 511 (Div. 1) (contest 1034), difficulty 1800-3500. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 511 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1800-3500 | 33m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Enlarge GCD	1800	number-theory	9,919	4m 46s	✓
B	Little C Loves 3 II	2200	brute-force, constructive-algorithms, flows	2,290	3m 31s
C	Region Separation	2700	combinatorics, dp, number-theory	993	10m 26s
D	Intervals of Intervals	3500	binary-search, data-structures, two-pointers	587	8m 30s
E	Little C Loves 3 III	3200	bitmasks, dp, math	750	6m 38s	✓

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

CF 1034D - Intervals of Intervals

We are given a sequence of geometric intervals on the number line. Think of each interval as a segment of paint on an infinite ruler. Now instead of working with single intervals, we look at contiguous blocks of these intervals.

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

CF 1034E - Little C Loves 3 III

We are given two arrays indexed by bitmasks of length n, so each index represents a subset of an n-element universe encoded as a binary number from 0 to 2^n - 1.

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

CF 1034C - Region Separation

Codeforces 1034C: Region Separation

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

CF 1034A - Enlarge GCD

We are given a list of positive integers and are allowed to delete some of them. After deletion, we look at the greatest common divisor of the remaining numbers.

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

CF 1034B - Little C Loves 3 II

We are given a very large rectangular grid where each cell can be identified by coordinates $(x, y)$. We repeatedly place two chess pieces at a time, but only if the Manhattan distance between the two chosen empty cells is exactly 3.