Codeforces Round 492 (Div. 1) [Thanks, uDebug!]

3 problems from Codeforces Round 492 (Div. 1) [Thanks, uDebug!] (contest 995), difficulty 1400-2700. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 492 (Div. 1) [Thanks, uDebug!]

Div. 1 | 3 problems | 2/3 verified | Difficulty 1400-2700 | 4m 40s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Tesla	2100	constructive-algorithms, implementation	1,807	2m
B	Suit and Tie	1400	greedy, implementation, math	7,444	1m 18s	✓
F	Cowmpany Cowmpensation	2700	combinatorics, dp, math	1,625	1m 22s	✓

Practice › Codeforces Solutions › Codeforces Round 492 (Div. 1) [Thanks, uDebug!] ›

CF 995F - Cowmpany Cowmpensation

We are given a rooted tree of employees where employee 1 is the CEO. Every other employee has exactly one direct superior, forming a hierarchy.

Practice › Codeforces Solutions › Codeforces Round 492 (Div. 1) [Thanks, uDebug!] ›

CF 995A - Tesla

We are given a parking grid with 4 rows and $n le 50$ columns. Each cell either holds a car or is empty. Cars are uniquely labeled from $1$ to $k$, with $k le 2n$. The middle two rows contain the cars in their starting positions.

Practice › Codeforces Solutions › Codeforces Round 492 (Div. 1) [Thanks, uDebug!] ›

CF 995B - Suit and Tie

We are given a lineup of $2n$ people where each integer label from $1$ to $n$ appears exactly twice. Each label represents a couple, so the goal is to rearrange the line so that both occurrences of every number sit next to each other.