Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)
7 problems from Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) (contest 958), difficulty 1500-3100. 3/7 solutions verified against sample I/O.
Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)
Special | 7 problems | 3/7 verified | Difficulty 1500-3100 | 12m 46s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A2 | Death Stars (medium) | 2000 | hashing, strings | 1,058 | 1m 31s | ✓ |
| A3 | Death Stars (hard) | 3100 | 53 | 59s | ✓ | |
| B2 | Maximum Control (medium) | 2200 | data-structures, dfs-and-similar, graphs | 747 | 2m 35s | |
| C2 | Encryption (medium) | 2000 | dp | 1,378 | 1m 26s | |
| E1 | Guard Duty (easy) | 1600 | brute-force, geometry, greedy | 1,782 | 39s | ✓ |
| E3 | Guard Duty (hard) | 2700 | geometry | 215 | 2m 25s | |
| F1 | Lightsabers (easy) | 1500 | implementation | 1,816 | 3m 11s |
CF 958F1 - Lightsabers (easy)
We are given a line of Jedi, each occupying a fixed position in an array, and each Jedi has one of several possible lightsaber colors. Alongside this, we are given a target specification that tells us how many Jedi of each color we must pick.
CF 958E3 - Guard Duty (hard)
We are given two sets of points in the plane, each containing the same number of points. One set represents spaceships, the other represents bases. Every point has a unique location, and no three points lie on a single straight line.
CF 958E1 - Guard Duty (easy)
We are given two small point sets in the plane, one representing Rebel ships and the other representing bases. Each ship must be assigned to exactly one base, and each base must also receive exactly one ship, so the assignment is a bijection between the two sets.
CF 958B2 - Maximum Control (medium)
We are given a tree with $N$ nodes, meaning every pair of nodes is connected by exactly one simple path. We are allowed to choose $K$ nodes as “active stations”.
CF 958C2 - Encryption (medium)
We are given a sequence of integers and asked to cut it into exactly $k$ contiguous non-empty segments. Each element must belong to exactly one segment, and the order of elements is preserved. For any segment, we take the sum of its elements, then reduce that sum modulo $p$.
CF 958A2 - Death Stars (medium)
We are given two rectangular grids of characters. The first grid has size $N times M$, while the second grid has size $M times N$.
CF 958A3 - Death Stars (hard)
We are given two separate point clouds in the plane. Each cloud contains many points, and both clouds include the same set of “true” points, but mixed with additional noise points.