Codeforces Round 632 (Div. 2)

3 problems from Codeforces Round 632 (Div. 2) (contest 1333), difficulty 1100-2100. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 632 (Div. 2)

Div. 2 | 3 problems | 1/3 verified | Difficulty 1100-2100 | 9m 5s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Kind Anton	1100	greedy, implementation	22,228	5m 17s
C	Eugene and an array	1700	binary-search, data-structures, implementation	13,362	2m 38s	✓
D	Challenges in school \u211641	2100	brute-force, constructive-algorithms, games	4,130	1m 10s

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

CF 1333B - Kind Anton

We are given two integer arrays of the same length. The first array starts with very restricted values, each position being either negative one, zero, or positive one. The second array can contain arbitrary integers, potentially very large in magnitude.

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

CF 1333C - Eugene and an array

We are given a sequence of integers and asked to count how many contiguous segments of this sequence are “robust” in a very specific sense. A segment is considered valid if every one of its nonempty contiguous subsegments has a sum that is not zero.

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

CF 1333D - Challenges in school №41

The reviewer is correct. The displayed sequences are not addition chains, because the quantities $2^g,2^h,2^k,2^m$ were used as summands without first appearing as chain elements. The argument must be rebuilt from the definition of a star chain.