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

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

4 items

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

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

#	Problem	Time	✓
A	Rather Perplexing Showdown	1m 14s	✓
B	Red Tape Committee	59s	✓
C	The Gardener of Seville	58s	✓
D	Freeform Factory	1m 16s	✓

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

CF 104568D - Freeform Factory

We are given a bipartite system with workers on one side and machines on the other, both of size $N$. Each worker initially knows how to operate some subset of machines. Every day, all workers arrive in an arbitrary order.

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

CF 104568A - Rather Perplexing Showdown

We are asked to construct an initial ordering of players in a knockout tournament. There are three types of players, Rock, Paper, and Scissors, with fixed counts.

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

CF 104568B - Red Tape Committee

We are asked to assemble a committee of exactly K people from a pool of N candidates. Each candidate behaves independently, and each one has a known probability Pi of voting “Yes”. A vote is always either Yes or No, so each candidate is a biased coin flip.

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

CF 104568C - The Gardener of Seville

We are given a rectangular grid of size $R times C$. Each cell must be filled with one of two diagonal slash types, either / or .