2017 Google Code Jam World Finals (GCJ 17 World Finals)

6 problems from 2017 Google Code Jam World Finals (GCJ 17 World Finals) (contest 104592), difficulty -. 6/6 solutions verified against sample I/O.

6 items

2017 Google Code Jam World Finals (GCJ 17 World Finals)

Special | 6 problems | 6/6 verified | Difficulty - | 7m 11s

#	Problem	Time	✓
A	Dice Straight	43s	✓
B	Operation	59s	✓
C	Spanning Planning	1m 56s	✓
D	Omnicircumnavigation	1m 54s	✓
E	Stack Management	43s	✓
F	Teleporters	56s	✓

Practice › Codeforces Solutions › 2017 Google Code Jam World Finals (GCJ 17 World Finals) ›

CF 104592D - Omnicircumnavigation

We are given a grid-based toy where balls fall from the top through a lattice of cells. Each column receives exactly one ball. Inside the grid, each cell is either empty or contains a diagonal ramp that redirects a falling ball either down-left or down-right.

Practice › Codeforces Solutions › 2017 Google Code Jam World Finals (GCJ 17 World Finals) ›

CF 104592F - Teleporters

We are given a starting point in 3D space, a target point, and up to about 150 special points called teleporters. Movement is not free: the only way to move is to choose a teleporter and perform a constrained jump. Each teleporter imposes a rule based on Manhattan distance.

Practice › Codeforces Solutions › 2017 Google Code Jam World Finals (GCJ 17 World Finals) ›

CF 104592E - Stack Management

We are given a collection of fixed “premade” card stacks. Each stack is an ordered sequence from top to bottom, and each card has two attributes: a value and a suit. In a test case, we do not construct stacks from scratch.

Practice › Codeforces Solutions › 2017 Google Code Jam World Finals (GCJ 17 World Finals) ›

CF 104592A - Dice Straight

We are given several independent test cases. In each test case there are multiple dice, and every die has exactly six positive integers written on its faces. When we place dice in a row, we pick exactly one face from each chosen die to be the “top” value of that die.

Practice › Codeforces Solutions › 2017 Google Code Jam World Finals (GCJ 17 World Finals) ›

CF 104592C - Spanning Planning

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 › 2017 Google Code Jam World Finals (GCJ 17 World Finals) ›

CF 104592B - Operation

Each test case gives a starting value and a collection of arithmetic “cards”. Every card is an operation with a fixed operand, and we are allowed to reorder these cards arbitrarily.