ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)
3 problems from ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) (contest 932), difficulty 800-2700. 1/3 solutions verified against sample I/O.
ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)
Div. 1+2 | 3 problems | 1/3 verified | Difficulty 800-2700 | 6m 25s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Palindromic Supersequence | 800 | constructive-algorithms | 10,892 | 1m 25s | ✓ |
| C | Permutation Cycle | 1600 | brute-force, constructive-algorithms | 4,239 | 3m 16s | |
| F | Escape Through Leaf | 2700 | data-structures, dp, geometry | 4,114 | 1m 44s |
CF 932C - Permutation Cycle
We are asked to construct a permutation of the numbers from 1 to N such that every position behaves in a very specific cyclic way.
CF 932F - Escape Through Leaf
We are working on a rooted tree where each node carries two numerical attributes, one acting like a “multiplier when leaving a node” and the other acting like a “weight when entering a node”.
CF 932A - Palindromic Supersequence
We are given a single lowercase string $A$. The task is to construct another string $B$ such that two conditions hold at the same time: $B$ must read the same forward and backward, and the string $A$ must appear inside $B$ as a subsequence, meaning we can delete some…