2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021)
13 problems from 2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021) (contest 104670), difficulty -. 13/13 solutions verified against sample I/O.
2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 5s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Antenna Analysis | 47s | ✓ | |||
| B | Breaking Bars | 1m 1s | ✓ | |||
| C | Customs Controls | 39s | ✓ | |||
| D | Deceptive Directions | 52s | ✓ | |||
| E | Eavesdropper Evasion | 1m 6s | ✓ | |||
| F | Fortune From Folly | 1m 16s | ✓ | |||
| G | Grazed Grains | 1m 3s | ✓ | |||
| H | Hiring Help | 1m 3s | ✓ | |||
| I | Intact Intervals | 49s | ✓ | |||
| J | Joint Jog Jam | 48s | ✓ | |||
| K | Knot Knowledge | 56s | ✓ | |||
| L | Locust Locus | 43s | ✓ | |||
| M | Marvelous Marathon | 1m 2s | ✓ |
CF 104670G - Grazed Grains
We are given a small collection of circular “damage zones” on an infinite plane. Each zone is defined by a center point and a radius, and it destroys everything inside or on that circle.
CF 104670M - Marvelous Marathon
We are given a 2-row grid stretched over a very long road with $m$ columns. Each column represents a meter, and at each column there are up to two values: a beauty value for running in the forward direction (top row) and a beauty value for running in the backward direction…
CF 104670L - Locust Locus
Each input line describes a pair of periodic events. For a given pair, two species reappear every fixed number of years, and we are told the last year when both of them appeared together. From that information we want to predict when that same pair will next appear together.
CF 104670K - Knot Knowledge
We are given a small fixed universe of knot identifiers, numbered from 1 to 1000. Sonja was assigned a list of exactly n distinct knots that she must learn.
CF 104670J - Joint Jog Jam
Two people start at two given coordinates on a plane and run in straight lines to their respective destinations in a fixed amount of time. Both move at constant speed, so each person’s position is a linear interpolation between their start and end points.
CF 104670I - Intact Intervals
We are given two arrays of length $n$, both containing the same multiset of values. The array is arranged in a circle, so position $n$ connects back to position $1$. We are allowed to cut some of the circular edges, which splits the circle into several contiguous linear segments.
CF 104670H - Hiring Help
Each employee is described by a pair of skills, how many lines of code they produce per hour and how many bugs they fix per hour.
CF 104670F - Fortune From Folly
We are looking at a process where a sequence of lootboxes is opened one after another. Each lootbox independently generates a random subset of up to $n$ possible “rare items”, and each item appears in a given box with probability $p$, independently from all other items and…
CF 104670E - Eavesdropper Evasion
Each message is an interval with a fixed length, and we are free to choose when each interval starts. Once started, a message runs continuously for its duration, and many messages can run at the same time without interference.
CF 104670D - Deceptive Directions
We are given a grid map with walkable cells, blocked cells, and a single starting position. From that start, there was originally a sequence of moves in four directions that would take you along a shortest path structure toward a treasure location.
CF 104670B - Breaking Bars
We are given several rectangular chocolate bars, each with integer dimensions up to 6 by 6. Each bar can be repeatedly cut into smaller rectangles by making straight cuts along grid lines, and every cut splits one rectangle into two smaller integer rectangles.
CF 104670A - Antenna Analysis
We are given a sequence of daily measurements, where each day has a single integer value. For every day i, we want to compare that day with any earlier day j, including itself, and compute how large a “meaningful jump” in measurement is between those two days after…
CF 104670C - Customs Controls
We are given a connected undirected graph where each vertex represents a customs checkpoint. Moving through a checkpoint takes a certain amount of time, while traveling along roads takes no time.