Codeforces Round 172 (Div. 1)

Solutions for Codeforces Round 172 (Div. 1) (contest 280). 1/2 problems verified against sample I/O. Difficulty range: 1800-3000.

2 items

Codeforces Round 172 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1800-3000 | Time: 3m 38s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Maximum Xor Secondary	1800	data-structures, implementation, two-pointers	1m 35s	✓
E	Sequence Transformation	3000	brute-force, data-structures, dp	2m 3s	✗

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

CF 280B - Maximum Xor Secondary

We are given an array of distinct positive integers. For every subarray, we look at its largest value and its second largest value, then compute their XOR. Among all possible subarrays, we need the maximum such XOR value.

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

CF 280E - Sequence Transformation

We are given a sorted sequence $x1, x2, dots, xn$. We want to construct another sequence $y1, y2, dots, yn$ such that every adjacent difference stays inside a fixed interval: $$a le y{i+1} - yi le b$$ and every value remains inside $[1, q]$.