Codeforces Round 239 (Div. 1)

5 problems from Codeforces Round 239 (Div. 1) (contest 407), difficulty 1600-3100. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 239 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1600-3100 | 23m 2s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Triangle	1600	brute-force, geometry, implementation	5,171	4m 33s	✓
B	Long Path	1600	dp, implementation	7,161	4m 14s	✓
C	Curious Array	2500	brute-force, combinatorics, implementation	1,193	5m
D	Largest Submatrix 3	2700	dp, hashing	804	4m 44s
E	k-d-sequence	3100	data-structures	974	4m 31s

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

CF 407E - k-d-sequence

We are given an integer sequence of length $n$ and two additional parameters: $k$, the maximum number of elements we are allowed to insert, and $d$, the intended difference of an arithmetic progression.

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

CF 407D - Largest Submatrix 3

We are given an integer matrix of size n by m. Each cell contains a positive integer. The task is to find the largest rectangular submatrix where all the elements are distinct. The “largest” is measured by area, meaning the number of cells inside the rectangle.

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

CF 407C - Curious Array

We are given an array and a sequence of range operations. Each operation picks a segment $[l, r]$ and a parameter $k$, and for every position $j$ inside that segment we add a value that depends on how far $j$ is from the left endpoint $l$.

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

CF 407A - Triangle

We are given two positive integers, a and b, which are the lengths of the legs of a right triangle. The task is not to check whether such a triangle exists, it obviously does.

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

CF 407B - Long Path

We are given a linear maze with n+1 rooms, numbered from 1 to n+1. Each room 1 through n has two portals. The first portal always moves forward to the next room, i+1. The second portal moves backward to some previous room, p₁ through pₙ, where pᵢ ≤ i.