Pinely Round 5 (Div. 1 + Div. 2)

8 problems from Pinely Round 5 (Div. 1 + Div. 2) (contest 2161), difficulty 800-3500. 1/8 solutions verified against sample I/O.

8 items

Pinely Round 5 (Div. 1 + Div. 2)

Div. 1+2 | 8 problems | 1/8 verified | Difficulty 800-3500 | 15m 15s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Round Trip	800	games, greedy, implementation	15,715	1m 31s	✓
B	Make Connected	1700	brute-force, implementation	5,369	1m 35s
C	Loyalty	1200	constructive-algorithms, greedy, sortings	12,536	1m 51s
D	Locked Out	2100	binary-search, data-structures, dp	2,771	1m 44s
E	Left is Always Right	2400	combinatorics, implementation, math	782	3m 29s
F	SubMST	3000	combinatorics, graphs, trees	344	1m 27s
G	Bitwise And Equals	3500	bitmasks, greedy	91	1m 49s
H	Cycle Sort	3500	data-structures	63	1m 49s

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161H - Cycle Sort

We are given two arrays, one of length $n$ and one of length $m$, and together they contain every number from $1$ to $n+m$ exactly once. You can think of the elements as being split into two buckets. We then simulate a long sequence of $k$ steps.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161E - Left is Always Right

We are given a binary string where some positions are fixed as 0 or 1, while others are unknown and can be chosen freely. Once we assign values to all unknowns, we obtain a fully concrete binary array of length n.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161G - Bitwise And Equals

We are given an array of integers and, for each query value X, we are allowed to increase individual elements of the array by repeatedly adding one. Each query is independent, and we always start from the same initial array.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161F - SubMST

We are asked to compute a global sum over all subsets of vertices in a tree. The input is an unweighted tree with n vertices. From this tree, we imagine a complete graph where the weight between any two vertices equals the distance between them in the original tree.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161D - Locked Out

We are given an array and we are allowed to delete elements from it. After deletions, we want the remaining sequence to satisfy a very specific restriction: it must not contain two elements where the later element is exactly one larger than the earlier element.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161C - Loyalty

We are asked to maximize bonus points in a store where every purchase can potentially increase our loyalty level. Each item has a price between 1 and some loyalty factor $X$. Initially, our loyalty level is calculated as the integer division of our total spend $S$ by $X$.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161B - Make Connected

We are given an $n times n$ grid with black cells marked and white cells marked .. Our goal is to paint some white cells black so that three conditions are met simultaneously. First, there must be at least one black cell.

Practice › Codeforces Solutions › Pinely Round 5 (Div. 1 + Div. 2) ›

CF 2161A - Round Trip

We are simulating a sequence of contest rounds where a participant can sometimes adjust their rating before each rated round.