Codeforces Round 471 (Div. 2)

4 problems from Codeforces Round 471 (Div. 2) (contest 955), difficulty 1100-2900. 1/4 solutions verified against sample I/O.

4 items

Codeforces Round 471 (Div. 2)

Div. 2 | 4 problems | 1/4 verified | Difficulty 1100-2900 | 8m 25s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Feed the cat	1100	greedy, math	7,023	1m 21s	✓
B	Not simply beatiful strings	1400	implementation	5,162	1m 18s
E	Icicles	2900		102	2m 26s
F	Heaps	2600	dp, trees	1,963	3m 20s

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

CF 955F - Heaps

We are given a rooted tree with $n$ nodes, rooted at node 1. For every node $u$, we consider a family of structures defined by an integer $k$, where a node can be thought of as the root of a “$k$-ary heap of depth $m$” if it has at least $k$ child-subtrees that themselves…

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

CF 955E - Icicles

We have a line of positions from 1 to n, each position containing an icicle with an initial height a[i]. Over time, two things happen: a sound wave spreads from a chosen starting point T, and the icicles touched by the wave begin to melt downward.

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

CF 955A - Feed the cat

Andrew wakes up at a given time of day and realizes his cat is hungry. The cat starts with some initial hunger value, and this hunger grows steadily over time at a fixed rate per minute. Andrew can reduce the cat’s hunger only by buying buns.

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

CF 955B - Not simply beatiful strings

We are given a single lowercase string. The task is to decide whether we can split its positions into two disjoint subsequences such that each subsequence forms a string that can be rearranged into exactly two contiguous blocks of equal characters, and those two blocks must…