2020 Google Code Jam Round 2 (GCJ 20 Round 2)

4 problems from 2020 Google Code Jam Round 2 (GCJ 20 Round 2) (contest 104631), difficulty -. 4/4 solutions verified against sample I/O.

4 items

2020 Google Code Jam Round 2 (GCJ 20 Round 2)

Special | 4 problems | 4/4 verified | Difficulty - | 3m 54s

# Problem Rating Tags Accepted Time ✓
A Incremental House of Pancakes 51s ✓
B Security Update 58s ✓
C Wormhole in One 58s ✓
D Emacs++ 1m 7s ✓
Practice › Codeforces Solutions › 2020 Google Code Jam Round 2 (GCJ 20 Round 2) ›

CF 104631D - Emacs++

We are given a string of balanced parentheses of length K. Every index is a position in a one-dimensional editor.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 Google Code Jam Round 2 (GCJ 20 Round 2) ›

CF 104631B - Security Update

We are given a network of computers connected by undirected links. Computer 1 is the source, and every other computer is reachable from it. Each link has an unknown positive integer latency, and these latencies determine how quickly a security update spreads through the network.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 Google Code Jam Round 2 (GCJ 20 Round 2) ›

CF 104631C - Wormhole in One

We are given a set of points in the plane, each representing a hole. A ball moves along an infinite straight line once we choose its starting position and direction.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 Google Code Jam Round 2 (GCJ 20 Round 2) ›

CF 104631A - Incremental House of Pancakes

We are given two piles of pancakes. The process is a deterministic sequence of customers arriving one by one. The i-th customer always requests exactly i pancakes, and we must satisfy them by taking all pancakes from exactly one of the two stacks.
codeforces competitive-programming Jun 29, 2026