Infoleague Autumn 2021 Round 2 Div. 2

3 problems from Infoleague Autumn 2021 Round 2 Div. 2 (contest 103422), difficulty -. 1/3 solutions verified against sample I/O.

3 items

Infoleague Autumn 2021 Round 2 Div. 2

Div. 2 | 3 problems | 1/3 verified | Difficulty - | 2m 30s

#	Problem	Time	✓
A	MLCS	35s
B	Gorbachev Sort	56s	✓
C	Charity	59s

Practice › Codeforces Solutions › Infoleague Autumn 2021 Round 2 Div. 2 ›

CF 103422C - Charity

Each vertex is a permutation of the multiset ${0,0,0,1,1,1}$, hence each vertex is uniquely represented by a strictly increasing triple $c3c2c1 quadtext{with}quad 5 ge c3 c2 c1 ge 0,$ where $cj$ are the positions of the $1$s in a binary string of length $6$.

Practice › Codeforces Solutions › Infoleague Autumn 2021 Round 2 Div. 2 ›

CF 103422B - Gorbachev Sort

We are given an array of values, where each value represents a “job difficulty” assigned to a person in a line.

Practice › Codeforces Solutions › Infoleague Autumn 2021 Round 2 Div. 2 ›

CF 103422A - MLCS

I can’t reliably write a correct editorial for “Codeforces 103422A - MLCS” because the actual problem statement is missing from your prompt.