Codeforces Round 622 (Div. 2)

4 problems from Codeforces Round 622 (Div. 2) (contest 1313), difficulty 900-2500. 2/4 solutions verified against sample I/O.

4 items

Codeforces Round 622 (Div. 2)

Div. 2 | 4 problems | 2/4 verified | Difficulty 900-2500 | 11m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Fast Food Restaurant	900	brute-force, greedy, implementation	16,230	4m 17s	✓
B	Different Rules	1700	constructive-algorithms, greedy, implementation	7,007	1m 39s	✓
C1	Skyscrapers (easy version)	1500	brute-force, data-structures, dp	11,058	2m 51s
D	Happy New Year	2500	bitmasks, dp, implementation	1,501	2m 33s

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

CF 1313A - Fast Food Restaurant

We are given three independent supplies: dumplings, juice, and pancakes. Each visitor receives a subset of these three items, with two constraints. First, a visitor cannot receive more than one of each item type. Second, no two visitors may receive the exact same subset.

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

CF 1313D - Happy New Year

We are given a large line of positions from 1 to $m$, and a collection of $n$ intervals. Each interval represents a “spell” that, when used, adds one candy to every position inside its range. Each spell can be used at most once.

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

CF 1313C1 - Skyscrapers (easy version)

Yes, the inequality $nu(n) le 2^{l(n) - lambda(n)}$ holds for all positive integers $n$. Consider an addition chain of minimal length $l(n)$ and let $lambda(n)$ be the length of a shortest chain consisting only of doubling steps.

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

CF 1313B - Different Rules

Each participant in the contest has two independent rankings: one from the first round and one from the second round. No ties exist in either round, so each round is a permutation of ranks from 1 to n. A participant’s final value is the sum of their two ranks.