Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)
2 problems from Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) (contest 963), difficulty 2000-2600. 1/2 solutions verified against sample I/O.
Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)
Div. 1 | 2 problems | 1/2 verified | Difficulty 2000-2600 | 3m 1s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| B | Destruction of a Tree | 2000 | constructive-algorithms, dfs-and-similar, dp | 3,000 | 1m 22s | |
| C | Cutting Rectangle | 2600 | brute-force, math, number-theory | 672 | 1m 39s | ✓ |
Practice
›
Codeforces Solutions
›
Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)
›
CF 963C - Cutting Rectangle
We are given a final collection of axis-aligned rectangles that come from cutting an unknown larger rectangle using only straight cuts parallel to its sides. Every cut is either horizontal or vertical, so the original rectangle is partitioned into a grid.
Practice
›
Codeforces Solutions
›
Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)
›
CF 963B - Destruction of a Tree
We are given a tree where each vertex has an associated current degree that changes as vertices are removed. A vertex is eligible for removal only when its degree is even at the moment we choose it.