2017 Google Code Jam Qualification Round (GCJ 17 Qualification Round)
4 problems from 2017 Google Code Jam Qualification Round (GCJ 17 Qualification Round) (contest 104582), difficulty -. 4/4 solutions verified against sample I/O.
2017 Google Code Jam Qualification Round (GCJ 17 Qualification Round)
Special | 4 problems | 4/4 verified | Difficulty - | 3m 28s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Oversized Pancake Flipper | 58s | ✓ | |||
| B | Tidy Numbers | 51s | ✓ | |||
| C | Bathroom Stalls | 53s | ✓ | |||
| D | Fashion Show | 46s | ✓ |
CF 104582D - Fashion Show
We are working on an $N times N$ grid where each cell can either stay empty or contain a model. Models come in three flavors: plus, cross, and a special combined type that contributes more value.
CF 104582A - Oversized Pancake Flipper
We are given a row of pancakes, each either happy side up or blank side up. We also have a flipper that always flips exactly K consecutive pancakes. Flipping reverses the state of each pancake in that segment.
CF 104582C - Bathroom Stalls
We are given a long row of stalls where both ends are permanently occupied, and in between there are N empty stalls. People enter one by one, and each person chooses a stall based on how far it is from the nearest occupied stall on both sides.
CF 104582B - Tidy Numbers
We are given several independent queries. Each query provides a positive integer $N$. Imagine we are counting upward from 1 to $N$, and for each number we check whether its decimal digits never decrease when read from left to right.