Codeforces Round 574 (Div. 2)

Solutions for Codeforces Round 574 (Div. 2) (contest 1195). 7/7 problems verified against sample I/O. Difficulty range: 1000-2500.

7 items

Codeforces Round 574 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 7/7 | Rating range: 1000-2500 | Time: 29m 30s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Drinks Choosing	1000	greedy, math	4m 43s	✓
B	Sport Mafia	1000	binary-search, brute-force, math	4m 45s	✓
C	Basketball Exercise	1400	dp	1m 23s	✓
D1	Submarine in the Rybinsk Sea (easy edition)	1500	combinatorics, math, number-theory	3m 46s	✓
D2	Submarine in the Rybinsk Sea (hard edition)	1800	combinatorics, math, number-theory	1m 24s	✓
E	OpenStreetMap	2100	data-structures, two-pointers	4m 46s	✓
F	Geometers Anonymous Club	2500	data-structures, geometry, math	8m 43s	✓

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

CF 1195F - Geometers Anonymous Club

We are given a sequence of convex polygons, and each polygon is described by its vertices in counterclockwise order. For any query interval $[l, r]$, we conceptually take all polygons in that range and compute their Minkowski sum.

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

CF 1195E - OpenStreetMap

We are given a large grid whose values are not stored explicitly but generated in row-major order from a linear recurrence. Each cell represents a height value.

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

CF 1195B - Sport Mafia

We are simulating a process that evolves in discrete moves. There is a container that starts empty, and Alya performs exactly n actions. The first action is fixed: she always adds exactly one candy.

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

CF 1195A - Drinks Choosing

We are given a group of students, each of whom prefers exactly one type of drink. The drink types are numbered from 1 to k. The preferences form an array where each entry tells us which drink a particular student likes.

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

CF 1195D1 - Submarine in the Rybinsk Sea (easy edition)

We are given an array of numbers, all written with the same number of digits. For every ordered pair of elements in this array, we must compute a special digit-interleaving function that builds a new number by taking digits from the two inputs in alternating order starting…

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

CF 1195D2 - Submarine in the Rybinsk Sea (hard edition)

We are given a list of integers, and we repeatedly apply a digit interleaving operation on every ordered pair of numbers in the list, including pairs where both elements are the same.

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

CF 1195C - Basketball Exercise

We are given two horizontal lines of students, each line containing the same number of people. Each student has a height, and we want to build a team by selecting students from these two rows under a strict ordering rule: once we start selecting from left to right, we can…