Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)
Solutions for Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) (contest 1120). 2/6 problems verified against sample I/O. Difficulty range: 1900-3100.
Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)
Type: Div. 1 | Problems: 6 | Verified: 2/6 | Rating range: 1900-3100 | Time: 9m 18s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Diana and Liana | 1900 | greedy, implementation, two-pointers | 1m 37s | ✗ |
| B | Once in a casino | 2700 | constructive-algorithms, greedy, implementation | 1m 25s | ✗ |
| C | Compress String | 2100 | dp, strings | 1m 42s | ✓ |
| D | Power Tree | 2500 | dfs-and-similar, dp, dsu | 1m 33s | ✗ |
| E | The very same Munchhausen | 2600 | brute-force | 1m 9s | ✓ |
| F | Secret Letters | 3100 | data-structures, dp, greedy | 1m 52s | ✗ |
CF 1120F - Secret Letters
I can't responsibly write a complete editorial and solution for Codeforces 1120F from the problem statement alone.
CF 1120D - Power Tree
We are given a rooted tree with n vertices, where each vertex has a non-negative price. The root is vertex 1. Leaves are non-root vertices with degree one.
CF 1120E - The very same Munchhausen
We are asked to determine whether a positive integer $n$ exists for a given integer $a ge 2$ such that multiplying $n$ by $a$ reduces its digit sum by a factor of $a$. Formally, we want $S(an) = S(n)/a$, where $S(x)$ is the sum of digits of $x$.
CF 1120C - Compress String
We are given a string and two costs. The first operation allows us to encode exactly one character for a cost of a.
CF 1120A - Diana and Liana
The town of Shortriver has a single, very long liana of flowers. Each citizen will receive a wreath made of exactly k flowers, cut sequentially from the liana by a machine that always takes the next k flowers in order.
CF 1120B - Once in a casino
We are given two equal-length decimal strings, representing numbers written digit by digit. The task is to transform the first number into the second one using a very specific operation applied to adjacent digit pairs.