2016 Google Code Jam World Finals (GCJ 16 World Finals)

5 problems from 2016 Google Code Jam World Finals (GCJ 16 World Finals) (contest 104579), difficulty -. 5/5 solutions verified against sample I/O.

5 items

2016 Google Code Jam World Finals (GCJ 16 World Finals)

Special | 5 problems | 5/5 verified | Difficulty - | 5m 6s

#	Problem	Time	✓
A	Integeregex	56s	✓
B	Family Hotel	1m 9s	✓
C	Gallery of Pillars	1m 13s	✓
D	Map Reduce	51s	✓
E	Radioactive Islands	57s	✓

Practice › Codeforces Solutions › 2016 Google Code Jam World Finals (GCJ 16 World Finals) ›

CF 104579C - Gallery of Pillars

We are looking at an $N times N$ grid of unit cells, where every cell except the southwest corner contains a vertical cylindrical pillar. The observer stands at the exact center of the southwest cell and looks into the grid.

Practice › Codeforces Solutions › 2016 Google Code Jam World Finals (GCJ 16 World Finals) ›

CF 104579E - Radioactive Islands

We are planning a continuous path for a point moving from a fixed starting location on the left side of the plane to a fixed ending location on the right side.

Practice › Codeforces Solutions › 2016 Google Code Jam World Finals (GCJ 16 World Finals) ›

CF 104579D - Map Reduce

The grid describes a map made of open cells, walls, a single start cell, and a single finish cell. Movement is allowed in four directions through open cells, and walls block movement entirely.

Practice › Codeforces Solutions › 2016 Google Code Jam World Finals (GCJ 16 World Finals) ›

CF 104579B - Family Hotel

We are given a line of rooms numbered from 1 to N. Guests arrive one by one, and each guest must be assigned exactly two adjacent rooms that are both still empty at the moment of assignment. If several adjacent empty pairs exist, one of them is chosen uniformly at random.

Practice › Codeforces Solutions › 2016 Google Code Jam World Finals (GCJ 16 World Finals) ›

CF 104579A - Integeregex

We are given a very small regular-expression language over decimal strings and asked to count how many integers in a given interval match it when interpreted as a pattern over their base-10 representation without leading zeros. The expression is not a full general regex engine.