2018 Google Code Jam Round 2 (GCJ 18 Round 2)

4 problems from 2018 Google Code Jam Round 2 (GCJ 18 Round 2) (contest 104595), difficulty -. 4/4 solutions verified against sample I/O.

4 items

2018 Google Code Jam Round 2 (GCJ 18 Round 2)

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

#	Problem	Time	✓
A	Falling Balls	49s	✓
B	Graceful Chainsaw Jugglers	1m	✓
C	Costume Change	59s	✓
D	Gridception	41s	✓

Practice › Codeforces Solutions › 2018 Google Code Jam Round 2 (GCJ 18 Round 2) ›

CF 104595A - Falling Balls

We are given a single array of length C describing how many balls end up in each column after falling through some hidden grid. Initially, one ball is dropped into every column at the top, so there are exactly C balls.

Practice › Codeforces Solutions › 2018 Google Code Jam Round 2 (GCJ 18 Round 2) ›

CF 104595D - Gridception

We are given a binary grid where each cell is either black or white. From this grid, we can repeatedly generate larger grids by replacing every cell with a 2×2 block of identical color.

Practice › Codeforces Solutions › 2018 Google Code Jam Round 2 (GCJ 18 Round 2) ›

CF 104595B - Graceful Chainsaw Jugglers

We are given a supply of two types of items, red chainsaws and blue chainsaws, and we want to distribute all of them among some number of jugglers.

Practice › Codeforces Solutions › 2018 Google Code Jam Round 2 (GCJ 18 Round 2) ›

CF 104595C - Costume Change

We are given an $N times N$ grid where each cell contains an integer. The absolute value represents a “color”, while the sign represents the “material”. So every cell encodes a single combined label: a signed integer.