Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2)
Solutions for Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) (contest 1588). 1/1 problems verified against sample I/O. Difficulty range: 3500-3500.
Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2)
Type: Div. 1 | Problems: 1 | Verified: 1/1 | Rating range: 3500-3500 | Time: 1m 41s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| F | Jumping Through the Array | 3500 | binary-search, data-structures, graphs | 1m 41s | ✓ |
Practice
›
Codeforces Solutions
›
Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2)
›
CF 1588F - Jumping Through the Array
We are given an array of integers a and a permutation p of size n. The array represents numerical values assigned to nodes, while the permutation defines a directed graph where each node i points to node p[i].