Codeforces Round 1031 (Div. 2)

6 problems from Codeforces Round 1031 (Div. 2) (contest 2113), difficulty 800-2800. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 1031 (Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-2800 | 9m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Shashliks	800	greedy, math	20,505	1m 9s	✓
B	Good Start	1200	constructive-algorithms, math	14,618	1m 39s
C	Smilo and Minecraft	1700	brute-force, constructive-algorithms, greedy	7,972	1m 42s	✓
D	Cheater	2200	binary-search, constructive-algorithms, greedy	2,876	1m 34s
E	From Kazan with Love	2800	dfs-and-similar, graphs, implementation	406	1m 46s	✓
F	Two Arrays	2500	constructive-algorithms, dfs-and-similar, graphs	951	1m 29s

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

CF 2113E - From Kazan with Love

We are given a tree representing a city. Marat starts at vertex x at time 1 and wants to reach vertex y. Each day progresses in discrete time steps, and at each step he can either stay in place or move along one edge of the tree. At the same time, there are up to 200 enemies.

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

CF 2113F - Two Arrays

We are given two arrays, a and b, each containing n integers. We can swap elements between the arrays at the same index as many times as we like. The goal is to maximize the sum of the number of distinct elements in each array.

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

CF 2113D - Cheater

We are given two ordered stacks of cards, one belonging to the player and one belonging to the dealer. Both stacks contain distinct values, and each stack is played from top to bottom. In every round, both sides reveal their current top card.

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

CF 2113C - Smilo and Minecraft

We are given a grid where each cell is either empty, stone, or gold. Smilo can only place dynamite in empty cells. When he detonates at an empty cell, it affects a square region centered there with fixed radius k, so the square has side length 2k + 1.

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

CF 2113B - Good Start

We are given a rectangular roof aligned with the coordinate axes, with width $w$ and height $h$. The roof lies in the plane starting from $(0,0)$. We also have identical rectangular tiles of fixed size $a times b$.

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

CF 2113A - Shashliks

We are given a grill that starts at some temperature and two types of shashlik that can be cooked repeatedly without limit. Each time we cook a portion, we must first check whether the current temperature is high enough, and then the grill’s temperature drops afterward.