2020 Google Code Jam Virtual World Finals (GCJ 20 Virtual World Finals)
5 problems from 2020 Google Code Jam Virtual World Finals (GCJ 20 Virtual World Finals) (contest 104634), difficulty -. 5/5 solutions verified against sample I/O.
2020 Google Code Jam Virtual World Finals (GCJ 20 Virtual World Finals)
Special | 5 problems | 5/5 verified | Difficulty - | 4m 27s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Pack the Slopes | 53s | ✓ | |||
| B | Adjacent and Consecutive | 58s | ✓ | |||
| C | Hexacoin Jam | 55s | ✓ | |||
| D | Musical Cords | 48s | ✓ | |||
| E | Replace All | 53s | ✓ |
CF 104634E - Replace All
We are given a starting string and a collection of operations, where each operation globally replaces every occurrence of one character with another fixed character.
CF 104634D - Musical Cords
We are given a circular harp with $N$ attachment points placed on its boundary. Each attachment point has a fixed angular position around the circle and a personal cost $Li$, which represents extra cord needed to attach a string to that point.
CF 104634B - Adjacent and Consecutive
We are simulating a two-player game where tiles labeled from 1 to N are gradually placed into N empty positions arranged in a line. Each move consists of choosing one unused number and placing it into an empty cell.
CF 104634C - Hexacoin Jam
We are given a list of N fixed hex numbers, each written with exactly D hexadecimal digits. We are also given a target interval $[S, E]$, also expressed as D-digit hexadecimal numbers.
CF 104634A - Pack the Slopes
We are given a rooted structure that is effectively a directed tree rooted at node 1. Every node is reachable from the root by exactly one directed path, so although edges may be listed in any orientation in the input, the underlying structure behaves like a tree with a unique…