Technocup 2022 - Elimination Round 2

Solutions for Technocup 2022 - Elimination Round 2 (contest 1584). 3/7 problems verified against sample I/O. Difficulty range: 800-3200.

7 items

Technocup 2022 - Elimination Round 2

Type: Special | Problems: 7 | Verified: 3/7 | Rating range: 800-3200 | Time: 22m 9s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Mathematical Addition	800	math	5m 41s	✗
B	Coloring Rectangles	1000	greedy, math	1m 43s	✓
C	Two Arrays	900	greedy, math, sortings	1m 42s	✓
D	Guess the Permutation	2000	binary-search, combinatorics, interactive	2m 25s	✗
E	Game with Stones	2300	binary-search, data-structures, games	2m 39s	✓
F	Strange LCS	2600	bitmasks, dp, graphs	5m 40s	✗
G	Eligible Segments	3200	geometry	2m 19s	✗

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584F - Strange LCS

We are given up to 10 strings, all over a mixed alphabet of lowercase and uppercase English letters. The task is to construct a single string that appears as a subsequence in every given string, and among all such strings we want the longest possible one.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584G - Eligible Segments

We have several points on the plane. We want to count pairs of points whose connecting segment stays close to every point in the set. More precisely, for a chosen pair $(pi,pj)$, every point must lie at distance at most $R$ from that segment.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584A - Mathematical Addition

For each test case we are given two positive integers, $u$ and $v$. We must find any pair of integers $x$ and $y$, not both zero, such that $$frac{x}{u}+frac{y}{v}=frac{x+y}{u+v}.$$ The task is not to count solutions or find a particular one.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584E - Game with Stones

We are given a sequence of piles of stones, each with a non-negative integer count. Bob can repeatedly remove one stone from two adjacent piles. If a pile becomes empty, it no longer counts as part of any adjacent pair.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584D - Guess the Permutation

We are given a sequence of length $n$ that initially contains integers from $1$ to $n$ in increasing order. Then the jury selects three indices $i < j < k$ with $j - i 1$ and reverses two subsegments: the first from $i$ to $j-1$, and the second from $j$ to $k$.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584B - Coloring Rectangles

We start with an $n times m$ grid of cells. The rectangle may be cut repeatedly along grid lines, producing smaller rectangles. The only restriction is that no final piece may have size $1 times 1$.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 2 ›

CF 1584C - Two Arrays

We are given two integer arrays of equal length. The allowed operation on the first array is quite specific: we may choose some subset of positions and increase each chosen element by exactly one. After that, we are allowed to freely reorder the array.