2017 Google Code Jam Round 3 (GCJ 17 Round 3)

4 problems from 2017 Google Code Jam Round 3 (GCJ 17 Round 3) (contest 104591), difficulty -. 4/4 solutions verified against sample I/O.

4 items

2017 Google Code Jam Round 3 (GCJ 17 Round 3)

Special | 4 problems | 4/4 verified | Difficulty - | 4m 18s

#	Problem	Time	✓
A	Googlements	57s	✓
B	Good News and Bad News	1m 11s	✓
C	Mountain Tour	1m 8s	✓
D	Slate Modern	1m 2s	✓

Practice › Codeforces Solutions › 2017 Google Code Jam Round 3 (GCJ 17 Round 3) ›

CF 104591D - Slate Modern

We are given a rectangular canvas, but the coordinates can be extremely large, so we should think of it as an infinite grid restricted to a huge box. Some cells are already fixed with brightness values.

Practice › Codeforces Solutions › 2017 Google Code Jam Round 3 (GCJ 17 Round 3) ›

CF 104591B - Good News and Bad News

The input describes a directed graph where vertices are friends and edges are communication links. Each ordered pair tells us that one friend can send a single piece of news to another friend.

Practice › Codeforces Solutions › 2017 Google Code Jam Round 3 (GCJ 17 Round 3) ›

CF 104591C - Mountain Tour

We are given a directed graph whose vertices are camps and whose edges are hiking tours. Every tour starts at a camp, ends at another camp, takes a fixed number of hours once started, and is only allowed to start at specific hours of the day, repeating every 24 hours.

Practice › Codeforces Solutions › 2017 Google Code Jam Round 3 (GCJ 17 Round 3) ›

CF 104591A - Googlements

We are given a string that represents a “googlement”, which is simply a digit string of length at most 9 with a constraint tied to its length. If the string has length $L$, every digit must lie in the range $0$ to $L$, and at least one digit must be nonzero.