Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3)
Solutions for Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3) (contest 1464). 0/1 problems verified against sample I/O. Difficulty range: 3500-3500.
Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3)
Type: Div. 1 | Problems: 1 | Verified: 0/1 | Rating range: 3500-3500 | Time: 2m 2s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| F | My Beautiful Madness | 3500 | data-structures, trees | 2m 2s | ✗ |
Practice
›
Codeforces Solutions
›
Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3)
›
CF 1464F - My Beautiful Madness
We maintain a multiset of paths on a tree. Paths can be inserted and deleted dynamically. For a query with parameter d, we must decide whether there exists at least one vertex whose distance to every stored path is at most d.