2021-2022 ICPC German Collegiate Programming Contest (GCPC 2021)
14 problems from 2021-2022 ICPC German Collegiate Programming Contest (GCPC 2021) (contest 106167), difficulty -. 14/14 solutions verified against sample I/O.
2021-2022 ICPC German Collegiate Programming Contest (GCPC 2021)
ICPC/IOI | 14 problems | 14/14 verified | Difficulty - | 14m 9s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Amusement Arcade | 50s | ✓ | |||
| B | Brexiting and Brentering | 44s | ✓ | |||
| C | Card Trading | 51s | ✓ | |||
| D | Decrypting Zodiac | 1m 8s | ✓ | |||
| E | Excursion to Porvoo | 1m | ✓ | |||
| F | Flappy Bird | 1m 12s | ✓ | |||
| G | Grid Delivery | 56s | ✓ | |||
| H | Hectic Harbour II | 1m 11s | ✓ | |||
| I | Index Case | 57s | ✓ | |||
| J | Joined Sessions | 1m 5s | ✓ | |||
| K | Killjoys' Conference | 1m 19s | ✓ | |||
| L | Looking for Waldo | 1m 14s | ✓ | |||
| M | Monty's Hall | 44s | ✓ | |||
| N | Natural Navigation | 58s | ✓ |
CF 106167G - Grid Delivery
The city is a rectangular grid of intersections, where each cell may contain a customer parcel that must be picked up. Movement is constrained by one-way streets: from any intersection you can only move either south or east.
CF 106167H - Hectic Harbour II
We are given two stacks of crates. Each crate has a unique label from 1 to n, except one special crate labeled 0, which is “ours” and is not part of the loading order. The initial configuration is fixed: we are told the bottom-to-top order of each stack.
CF 106167K - Killjoys' Conference
We are given a group of people and a list of pairs who cannot sit in the same room. A valid meeting arrangement assigns every person to exactly one of two rooms, East or West, such that every “dislike” pair is split across rooms.
CF 106167D - Decrypting Zodiac
We are given two strings of equal length. One is the observed encrypted text, and the other is a candidate original message that we believe might have been encrypted to produce it. The encryption process is two-layered.
CF 106167M - Monty's Hall
We are given a hall with $d$ doors. Exactly one door hides a prize, and all others are empty. The player is allowed to initially choose a group of $s$ doors instead of just one.
CF 106167C - Card Trading
Each card type comes with a collection of buy and sell offers, each tied to a specific price level. A buy offer at price p means someone is willing to purchase at any market price up to p.
CF 106167N - Natural Navigation
We are given a directed graph where intersections are nodes and footpaths are weighted directed edges. Each edge has a travel time and also a set of visible colors. A navigation system works in a peculiar way: at any intersection, it displays a single color.
CF 106167L - Looking for Waldo
We are given a grid of uppercase letters. The task is to find the smallest axis-aligned rectangle such that inside that rectangle there is at least one occurrence of each of the five letters W, A, L, D, and O.
CF 106167J - Joined Sessions
We are given a collection of closed time intervals representing meetings. Each meeting occupies a segment on a number line, and two meetings are considered compatible for merging if their time intervals overlap in the sense that they share at least one point, including endpoints.
CF 106167I - Index Case
We are given a circular line of n positions, where each position holds a value between 1 and m. We are also given a deterministic update rule f that takes three consecutive values on this circle and produces the next-day value for the middle position.
CF 106167F - Flappy Bird
We are given a start point and an end point in the plane, and between them lies a sequence of vertical “gate positions” at strictly increasing x-coordinates.
CF 106167E - Excursion to Porvoo
We are given a route that always moves forward through cities in a fixed order from city 1 to city n. Between every consecutive pair of cities i and i+1 there are several alternative roads, each with two properties: a travel time and a maximum supported vehicle weight.
CF 106167A - Amusement Arcade
We are given a line of $n$ seats arranged in a row, indexed from 1 to $n$. A group of people arrives one by one and each person must choose a seat. The rule is that every new person always sits in a position that maximizes their distance to the nearest already occupied seat.
CF 106167B - Brexiting and Brentering
We are given a single string that represents the name of some entity, such as a person, country, or organization. From this name, we must construct a new word that describes the “entering action” for that entity using a fixed linguistic rule.