Codeforces Round 493 (Div. 1)

3 problems from Codeforces Round 493 (Div. 1) (contest 997), difficulty 1500-3000. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 493 (Div. 1)

Div. 1 | 3 problems | 3/3 verified | Difficulty 1500-3000 | 4m

#	Problem	Rating	Tags	Accepted	Time	✓
A	Convert to Ones	1500	brute-force, greedy, implementation	8,662	1m 14s	✓
C	Sky Full of Stars	2500	combinatorics, math	2,176	1m 19s	✓
E	Good Subsegments	3000	data-structures	1,662	1m 27s	✓

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

CF 997E - Good Subsegments

We are given a permutation, meaning every value from 1 to n appears exactly once in an array. For any contiguous segment of this array, we call it good when it has a very strong structural property: if you take the smallest and largest values inside that segment, then every…

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

CF 997C - Sky Full of Stars

We are working with an $n times n$ grid where each cell independently takes one of three colors. A coloring is considered “good” if at least one full row or at least one full column ends up monochromatic, meaning every cell in that row or column shares the same color.

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

CF 997A - Convert to Ones

We are given a binary string and we want to transform it into a string of all ones. Two types of operations are available: we can reverse any contiguous segment for a cost, or we can flip all bits in a contiguous segment for a cost.