Anton Trygub Contest 2 (The 3rd Universal Cup, Stage 3: Ukraine)
12 problems from Anton Trygub Contest 2 (The 3rd Universal Cup, Stage 3: Ukraine) (contest 105384), difficulty -. 12/12 solutions verified against sample I/O.
Anton Trygub Contest 2 (The 3rd Universal Cup, Stage 3: Ukraine)
Special | 12 problems | 12/12 verified | Difficulty - | 13m 27s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Aibohphobia | 48s | ✓ | |||
| B | Breaking Bad | 54s | ✓ | |||
| C | Chemistry Class | 54s | ✓ | |||
| D | Daily Disinfection | 57s | ✓ | |||
| E | Equalizer Ehrmantraut | 1m 11s | ✓ | |||
| F | Formal Fring | 1m 10s | ✓ | |||
| G | Goodman | 1m 25s | ✓ | |||
| H | Highway Hoax | 56s | ✓ | |||
| I | Increasing Income | 1m 28s | ✓ | |||
| J | Jesse's Job | 1m 4s | ✓ | |||
| K | Knocker | 1m 23s | ✓ | |||
| L | Lalo's Lawyer Lost | 1m 17s | ✓ |
CF 105384L - Lalo's Lawyer Lost
We are given an undirected graph with a special structure: every edge belongs to at most one simple cycle. This means the graph is a cactus, so cycles do not overlap except possibly at shared vertices, and if you remove cycle edges appropriately the remaining structure becomes…
CF 105384K - Knocker
We are given an initial array of small positive integers. One operation chooses a positive integer $x$, and then every element of the array is simultaneously replaced by its remainder when divided by $x$.
CF 105384H - Highway Hoax
We are given a directed tree, meaning there are n nodes and n−1 edges, and if we ignore edge directions the graph is connected and acyclic. Each node is labeled either S or F.
CF 105384G - Goodman
We are given a permutation $p$ over numbers from $1$ to $n$. We are allowed to choose another permutation $q$, which is simply an ordering of the same $n$ elements.
CF 105384D - Daily Disinfection
We are given a line of positions representing a shelf. Each position is either empty or occupied by a book. The goal is to make every position “clean”, but there is a restriction: a position containing a book cannot be cleaned directly.
CF 105384A - Aibohphobia
We are given a string for each test case and are allowed to permute its characters arbitrarily. After choosing a final arrangement, we examine every prefix of length at least two. The requirement is that none of these prefixes is a palindrome.
CF 105384I - Increasing Income
We are given a fixed permutation $p$ of size $n$. We are allowed to choose another permutation $q$ of the indices $1$ to $n$.
CF 105384J - Jesse's Job
We are given a permutation of length $n$. Jesse is allowed to split the positions into two nonempty groups. One group is colored yellow, the other blue.
CF 105384E - Equalizer Ehrmantraut
We are counting how many pairs of arrays $a$ and $b$, both of length $n$, can be formed using values from $1$ to $m$, such that a specific symmetry condition holds between every pair of positions. Pick any two indices $i < j$.
CF 105384F - Formal Fring
We are given an integer X, and we consider all multisets made of powers of two such that their sum equals X. Each multiset is just a collection like {1, 1, 2, 8, 8} whose total sum is X. From each such multiset S, we imagine splitting its elements into two groups S1 and S2.
CF 105384B - Breaking Bad
We are given an $n times n$ grid where each cell contains a value between 0 and 4. We must choose exactly one cell from every row and every column, which means we are effectively selecting a permutation of columns for the rows.
CF 105384C - Chemistry Class
We are given an even number of students, specifically 2n, each with a numeric chemistry skill. The teacher must split them into n disjoint pairs, so every student belongs to exactly one pair.