Codeforces Round 738 (Div. 2)

6 problems from Codeforces Round 738 (Div. 2) (contest 1559), difficulty 900-2500. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 738 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 900-2500 | 13m 14s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Mocha and Math	900	bitmasks, constructive-algorithms, math	45,555	1m 20s	✓
B	Mocha and Red and Blue	900	dp, greedy	24,129	5m 16s
C	Mocha and Hiking	1200	constructive-algorithms, graphs	22,792	2m 31s
D1	Mocha and Diana (Easy Version)	1400	brute-force, constructive-algorithms, dsu	16,024	1m 18s	✓
D2	Mocha and Diana (Hard Version)	2500	brute-force, constructive-algorithms, dfs-and-similar	3,064	1m 34s	✓
E	Mocha and Stars	2200	combinatorics, dp, fft	2,714	1m 15s	✓

Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559D1 - Mocha and Diana (Easy Version)

We are given two forests on the same set of labeled nodes from 1 to n. Each forest is just a collection of edges that never forms a cycle, though each forest can be disconnected and consist of multiple trees.

Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559E - Mocha and Stars

We are counting how many ways we can assign an integer brightness value to each of $n$ stars. Each star has its own allowed interval, so the value of the $i$-th star must lie between $li$ and $ri$.

Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559B - Mocha and Red and Blue

We are given a line of positions, each position holding a tile that must end up colored either red or blue. Some tiles are already fixed, while others are blank and can be assigned either color.

Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559C - Mocha and Hiking

Codeforces 1559C: Mocha and Hiking

Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559D2 - Mocha and Diana (Hard Version)

We are given two different forests built on the same set of vertices from 1 to n. Each forest is already acyclic, but they may have multiple connected components.

Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559A - Mocha and Math

We are given an array of integers and allowed to perform a repeated operation: choose any contiguous subarray and replace each element in it with the bitwise AND of itself and its symmetric counterpart relative to the interval.