2016 Google Code Jam Round 3 (GCJ 16 Round 3)

4 problems from 2016 Google Code Jam Round 3 (GCJ 16 Round 3) (contest 104569), difficulty -. 4/4 solutions verified against sample I/O.

4 items

2016 Google Code Jam Round 3 (GCJ 16 Round 3)

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

#	Problem	Time	✓
A	Teaching Assistant	57s	✓
B	Forest University	58s	✓
C	Rebel Against The Empire	1m 13s	✓
D	Go++	58s	✓

Practice › Codeforces Solutions › 2016 Google Code Jam Round 3 (GCJ 16 Round 3) ›

CF 104569D - Go++

We are asked to design two tiny concurrent programs that share a single boolean register. The register starts at 0 and can be overwritten by instructions that force it to 0 or 1.

Practice › Codeforces Solutions › 2016 Google Code Jam Round 3 (GCJ 16 Round 3) ›

CF 104569C - Rebel Against The Empire

We are given a set of asteroids in 3D space. Each asteroid has an initial position and a constant velocity, so its location at time $t$ is a straight line in space. We start on asteroid 0 at time 0, and we want to reach asteroid 1.

Practice › Codeforces Solutions › 2016 Google Code Jam Round 3 (GCJ 16 Round 3) ›

CF 104569B - Forest University

We are given a collection of courses that form a prerequisite forest. Each course has a single outgoing edge to its prerequisite, or no prerequisite at all. This guarantees that the structure is a directed forest of rooted trees, where edges point from a node to its parent.

Practice › Codeforces Solutions › 2016 Google Code Jam Round 3 (GCJ 16 Round 3) ›

CF 104569A - Teaching Assistant

We are given a sequence of days, and on each day we are allowed to perform exactly one action among three choices: we can request a Coding problem set, request a Jamming problem set, or submit the most recently requested problem set that has not yet been submitted.