Codeforces Round 736 (Div. 1)

6 problems from Codeforces Round 736 (Div. 1) (contest 1548), difficulty 1400-3400. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 736 (Div. 1)

Div. 1 | 6 problems | 2/6 verified | Difficulty 1400-3400 | 29m 12s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Web of Lies	1400	brute-force, graphs, greedy	17,730	3m 42s
B	Integers Have Friends	1800	binary-search, data-structures, divide-and-conquer	11,343	2m 20s	✓
C	The Three Little Pigs	2500	combinatorics, dp, fft	2,038	5m 48s
D1	Gregor and the Odd Cows (Easy)	2300	bitmasks, geometry, math	1,623	6m 39s	✓
D2	Gregor and the Odd Cows (Hard)	3300	brute-force, geometry, math	283	4m 36s
E	Gregor and the Two Painters	3400	data-structures, divide-and-conquer, graphs	601	6m 7s

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

CF 1548E - Gregor and the Two Painters

The ceiling is split into a grid where each row contributes a fixed amount of paint and each column contributes another fixed amount. This makes every cell’s paint level completely determined by two arrays: one attached to rows and one attached to columns.

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

CF 1548D2 - Gregor and the Odd Cows (Hard)

We are given a set of points on the plane that act as fixed vertices. From these points, we choose any three distinct points to form a triangle. Inside this triangle lies an infinite integer grid of “cows”, one at every lattice point.

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

CF 1548D1 - Gregor and the Odd Cows (Easy)

We are given a set of points on a plane that serve as possible vertices of a triangle. Every point has even integer coordinates, and no three points are collinear. From these points we choose any triple and form a triangle.

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

CF 1548C - The Three Little Pigs

We are looking at a process that lasts for $n$ minutes. Each minute, exactly three new items are added, so after minute $t$, there are $3t$ items available.

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

CF 1548A - Web of Lies

We are working with a graph whose vertices are fixed nobles numbered from 1 to n, where the label also represents their strength. Edges represent mutual friendships, and these edges change over time through insertions and deletions.

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

CF 1548B - Integers Have Friends

We are given a list of distinct positive integers, and we want to identify the largest contiguous subarray where all elements are congruent modulo some integer greater than or equal to 2.