Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2)

Solutions for Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) (contest 1130). 2/3 problems verified against sample I/O. Difficulty range: 800-1400.

3 items

Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-1400 | Time: 4m 41s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Be Positive	800	implementation	1m 52s	✗
B	Two Cakes	1200	greedy	1m 35s	✓
C	Connect	1400	brute-force, dfs-and-similar, dsu	1m 14s	✓

Practice › Codeforces Solutions › Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) ›

CF 1130A - Be Positive

We are given an array containing positive numbers, negative numbers, and possibly zeros. We need to choose a non-zero integer $d$ such that after dividing every element by $d$, at least half of the array elements are positive.

Practice › Codeforces Solutions › Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) ›

CF 1130B - Two Cakes

We are given a street with $2n$ consecutive houses, each house selling exactly one cake tier of a specific size between $1$ and $n$. Every size appears exactly twice. Two people start at house $1$.

Practice › Codeforces Solutions › Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) ›

CF 1130C - Connect

We are given a square grid representing a planet with land and water. Alice starts at one land cell and wants to reach another land cell. She can only walk on land, moving orthogonally between adjacent cells. If a path exists naturally, she can reach her destination at zero cost.