2020 Google Code Jam Qualification Round (GCJ 20 Qualification Round)
10 problems from 2020 Google Code Jam Qualification Round (GCJ 20 Qualification Round) (contest 104660), difficulty -. 10/10 solutions verified against sample I/O.
2020 Google Code Jam Qualification Round (GCJ 20 Qualification Round)
Special | 10 problems | 10/10 verified | Difficulty - | 8m 20s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A1 | Vestigium A1 | 42s | ✓ | |||
| B1 | Nesting Depth B1 | 46s | ✓ | |||
| B2 | Nesting Depth B2 | 46s | ✓ | |||
| C1 | Parenting Partnering Returns C1 | 44s | ✓ | |||
| C2 | Parenting Partnering Returns C2 | 49s | ✓ | |||
| D1 | ESAb ATAd D1 | 54s | ✓ | |||
| D2 | ESAb ATAd D2 | 58s | ✓ | |||
| D3 | ESAb ATAd D3 | 46s | ✓ | |||
| E1 | Indicium E1 | 1m 1s | ✓ | |||
| E2 | Indicium E2 | 54s | ✓ |
CF 104660D3 - ESAb ATAd D3
We are dealing with an interactive reconstruction task on a hidden binary string of length $N$. The string is not given upfront. Instead, we can query positions to learn individual bits, and our goal is to eventually output the entire string correctly.
CF 104660E2 - Indicium E2
We are asked to construct a structured $n times n$ grid filled with numbers from $1$ to $n$ such that each number appears exactly once in every row and exactly once in every column. This is the classical Latin square requirement.
CF 104660E1 - Indicium E1
We are asked to construct a Latin square of size $n times n$, meaning a grid filled with numbers from $1$ to $n$ such that every number appears exactly once in each row and exactly once in each column.
CF 104660D2 - ESAb ATAd D2
We are interacting with a hidden binary array whose contents we must reconstruct. The array has fixed length, but we do not know its values initially. We are allowed to query individual positions and receive the bit stored there. The interaction has an additional complication.
CF 104660D1 - ESAb ATAd D1
We are interacting with a hidden binary array whose length is known, but whose contents are unknown. Our task is to reconstruct the entire array using queries that ask for the value at a particular position. The twist is that the judge does not keep the array static.
CF 104660C2 - Parenting Partnering Returns C2
We are given a set of time intervals, each representing an activity that must be assigned to one of two people. Each activity has a start time and an end time, and the assignment must ensure that a single person is never assigned two overlapping activities.
CF 104660C1 - Parenting Partnering Returns C1
We are given a list of time intervals representing tasks that must be scheduled on two identical resources, typically thought of as two people alternating work.
CF 104660B1 - Nesting Depth B1
We are given a sequence of digits written in a row. The task is to insert parentheses around this sequence so that each digit ends up being surrounded by a number of matching parentheses equal to its value, interpreted as a nesting depth.
CF 104660B2 - Nesting Depth B2
The task deals with a string of decimal digits where each digit describes how “deep” we are in a conceptual nesting structure.
CF 104660A1 - Vestigium A1
We are given a square grid of size $n times n$, filled with integers. From this grid, we need to compute three values. First, we compute the trace of the matrix, which is the sum of the elements on the main diagonal, meaning positions $(1,1), (2,2), dots, (n,n)$.