Codeforces Round 150 (Div. 1)

5 problems from Codeforces Round 150 (Div. 1) (contest 243), difficulty 1600-3000. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 150 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1600-3000 | 11m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Brand New Function	1600	bitmasks	4,464	1m 27s	✓
B	Hydra	2000	graphs, sortings	1,328	3m 20s
C	Colorado Potato Beetle	2200	dfs-and-similar, implementation	563	1m 37s
D	Cubes	2700	data-structures, dp, geometry	232	3m 9s	✓
E	Matrix	3000	data-structures	216	1m 31s

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

CF 243A - The Brand New Function

We are given a sequence of non-negative integers. For any contiguous subarray of this sequence, we can compute its bitwise OR. The problem asks for the number of distinct values obtained from all such subarrays.

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

CF 243B - Hydra

We are given an undirected simple graph and two small integers $h$ and $t$. We are asked to determine whether inside this graph there exists a very specific structure consisting of two special vertices connected by an edge.

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

CF 243C - Colorado Potato Beetle

We are working on an enormous infinite grid of unit square cells, and we can think of each cell as a “bed” in a potato field. We start in the center cell and walk according to a sequence of axis-aligned moves.

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

CF 243D - Cubes

We are given an n×n grid representing a city built from unit cubes stacked in towers. Each cell of the grid contains an integer indicating the height of the tower at that location.

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

CF 243E - Matrix

We are given a square grid of size $n times n$, where every cell contains either 0 or 1. The operation allowed is to permute the columns arbitrarily.