2015 Google Code Jam Round 1A (GCJ 15 Round 1A)

3 problems from 2015 Google Code Jam Round 1A (GCJ 15 Round 1A) (contest 104550), difficulty -. 3/3 solutions verified against sample I/O.

3 items

2015 Google Code Jam Round 1A (GCJ 15 Round 1A)

Special | 3 problems | 3/3 verified | Difficulty - | 2m 52s

#	Problem	Time	✓
A	Mushroom Monster	51s	✓
B	Haircut	51s	✓
C	Logging	1m 10s	✓

Practice › Codeforces Solutions › 2015 Google Code Jam Round 1A (GCJ 15 Round 1A) ›

CF 104550C - Logging

We are given a set of points in the plane, each representing a tree. If we wrap all trees with a tight rubber band, we get the convex hull of the set. Trees lying on this hull are already on the forest boundary, while trees inside are not.

Practice › Codeforces Solutions › 2015 Google Code Jam Round 1A (GCJ 15 Round 1A) ›

CF 104550A - Mushroom Monster

We are given a sequence of observations taken at fixed time intervals, where each value represents how many mushrooms are on a plate at that moment. Between observations, mushrooms may be added arbitrarily, and they may also be eaten.

Practice › Codeforces Solutions › 2015 Google Code Jam Round 1A (GCJ 15 Round 1A) ›

CF 104550B - Haircut

We are simulating a barber shop where multiple barbers work in parallel, each with a fixed haircut duration. Customers arrive in a strict queue, and each customer is assigned to a barber according to a simple rule: whenever someone becomes free, the next waiting customer…