Codeforces Round 641 (Div. 1)

Solutions for Codeforces Round 641 (Div. 1) (contest 1349). 3/3 problems verified against sample I/O. Difficulty range: 2000-3100.

3 items

Codeforces Round 641 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 3/3 | Rating range: 2000-3100 | Time: 17m 44s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Orac and Medians	2000	constructive-algorithms, greedy, math	2m 39s	✓
C	Orac and Game of Life	2000	dfs-and-similar, graphs, implementation	12m 36s	✓
F1	Slime and Sequences (Easy Version)	3100	dp, fft, math	2m 29s	✓

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

CF 1349C - Orac and Game of Life

The grid evolves in discrete time. Each cell has one of two colors and updates simultaneously each step based only on its four neighbors. A cell looks at the current state. If none of its neighbors share its color, it stays unchanged.

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

CF 1349F1 - Slime and Sequences (Easy Version)

We are asked to count appearances of numbers in a special class of integer sequences called good sequences. A sequence of length n is considered good if, for every number k 1 that appears, there is at least one occurrence of k-1 somewhere earlier in the sequence.

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

CF 1349B - Orac and Medians

We are given several independent queries. Each query provides a sequence of integers and a target value $k$. We are allowed to repeatedly choose any contiguous segment of the sequence and replace every element in that segment with the median of that segment.