Codeforces Round 487 (Div. 2)

3 problems from Codeforces Round 487 (Div. 2) (contest 989), difficulty 900-2500. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 487 (Div. 2)

Div. 2 | 3 problems | 1/3 verified | Difficulty 900-2500 | 5m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	A Blend of Springtime	900	implementation, strings	11,161	1m 16s	✓
C	A Mist of Florescence	1800	constructive-algorithms, graphs	4,034	1m 54s
D	A Shade of Moonlight	2500	binary-search, geometry, math	536	2m 41s

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

CF 989D - A Shade of Moonlight

We are given several “clouds” moving along a line. Each cloud is a segment of fixed length $l$, initially placed at position $xi$, and then moving over time with constant velocity $vi + w$, where $vi$ is either $+1$ or $-1$, and $w$ is a global wind parameter we are allowed…

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

CF 989C - A Mist of Florescence

We are asked to construct a rectangular grid and fill it with four letters, each representing a type of flower. The grid should be designed so that when we look at each letter separately, counting connected components using edge adjacency, the number of components for the four…

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

CF 989A - A Blend of Springtime

We are given a short string representing a row of cells. Each cell is either empty or contains exactly one flower of one of three types, encoded as the letters A, B, and C.