Codeforces Round 541 (Div. 2)

Solutions for Codeforces Round 541 (Div. 2) (contest 1131). 4/7 problems verified against sample I/O. Difficulty range: 800-2700.

7 items

Codeforces Round 541 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 4/7 | Rating range: 800-2700 | Time: 10m 40s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sea Battle	800	math	2m 2s	✓
B	Draw!	1400	greedy, implementation	1m 16s	✓
C	Birthday	1200	binary-search, greedy, sortings	1m 28s	✓
D	Gourmet choice	2000	dfs-and-similar, dp, dsu	1m 28s	✗
E	String Multiplication	2300	dp, greedy, strings	1m 33s	✓
F	Asya And Kittens	1700	constructive-algorithms, dsu	1m 22s	✗
G	Most Dangerous Shark	2700	data-structures, dp, two-pointers	1m 31s	✗

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

CF 1131G - Most Dangerous Shark

We are given a long line of dominoes. Each domino has a height and a cost. When you push a domino, it falls either left or right, and during its fall it can trigger other dominoes if they lie within its reach.

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

CF 1131F - Asya And Kittens

We are given a set of kittens, each initially in its own cell arranged linearly in a row. Over the course of $n-1$ days, Asya records pairs of kittens who wanted to play together and removes the partition between their cells.

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

CF 1131E - String Multiplication

We are asked to compute a property of a highly structured string operation. We are given a sequence of strings $p1, p2, dots, pn$, and we are asked to repeatedly apply Denis's string multiplication: multiplying $p1 cdot p2 cdot dots cdot pn$ in order.

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

CF 1131D - Gourmet choice

The problem asks us to assign positive integer scores to two sets of dishes tasted by Mr. Apple on two separate days. Each dish on the first day can be compared to every dish on the second day, and the comparison is either better, worse, or equal.

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

CF 1131A - Sea Battle

The ship is formed by stacking two axis-aligned rectangles. The lower rectangle has width w1 and height h1. The upper rectangle has width w2 and height h2, and it starts immediately above the first rectangle with their left edges aligned.

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

CF 1131C - Birthday

We are asked to arrange a group of children in a circle such that the maximum height difference between any two adjacent children is as small as possible. The input provides the number of children n and an array of their heights.

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

CF 1131B - Draw!

We are given a sequence of partial observations of a football match. Each observation tells us the score at some moment in time, and these observations are already sorted by time.