2019-2020 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2019)
11 problems from 2019-2020 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2019) (contest 105472), difficulty -. 10/11 solutions verified against sample I/O.
2019-2020 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2019)
ICPC/IOI | 11 problems | 10/11 verified | Difficulty - | 12m 40s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Alphabet Animals | 1m 5s | ✓ | |||
| B | Building Boundaries | 1m 5s | ✓ | |||
| C | Cocoa Coalition | 59s | ✓ | |||
| D | Dungeon Dawdler | 1m 20s | ✓ | |||
| E | Eeny Meeny | 54s | ✓ | |||
| F | Flow Finder | 1m 27s | ✓ | |||
| G | Game of Gnomes | 1m 3s | ✓ | |||
| H | Hot Hike | 46s | ✓ | |||
| I | Incremental Induction | 53s | ✓ | |||
| J | Jealous Youngsters | 1m 53s | ||||
| K | Keep it Cool | 1m 15s | ✓ |
CF 105472J - Jealous Youngsters
Something went wrong while generating the response. If this issue persists please contact us through our help center at [help.openai.com](https://help.openai.com/).
CF 105472H - Hot Hike
We are given a sequence of daily temperatures covering a vacation of length $n$. We must choose a continuous block of exactly three consecutive days: the first day is hiking up to a lake, the second day is rest (ignored for heat considerations), and the third day is hiking back.
CF 105472D - Dungeon Dawdler
We are inside an unknown rectangular dungeon made of grid cells. Each cell is either a wall or a walkable space, and the walkable space has a special twist: there can be up to two trapdoors that behave like hidden teleporters.
CF 105472A - Alphabet Animals
We are given the last animal name spoken by the previous player and a pool of unused animal names. A valid move for us must satisfy a chaining rule: the new name must begin with the last character of the previous name, and it must not have been used before.
CF 105472G - Game of Gnomes
We are given a set of identical units called gnomes, and we must split them into at most a fixed number of groups before the process starts.
CF 105472K - Keep it Cool
We are given a fridge divided into several independent slots. Each slot already contains some number of cold soda bottles, and each slot also has a fixed maximum capacity.
CF 105472I - Incremental Induction
We are given the complete results of a round-robin tournament among $n$ contestants, but the results are encoded incrementally. For every pair of contestants $i < j$, we know whether contestant $j$ defeated contestant $i$.
CF 105472F - Flow Finder
The tree describes a system where every node carries a nonnegative “flow value”. Leaves represent independent sources of water and may take any positive integer value. Every internal node represents a confluence, and its value is exactly the sum of the values of its children.
CF 105472E - Eeny Meeny
We are simulating a selection process on a circular arrangement of children. The children stand in a fixed clockwise order, and we repeatedly remove one child at a time based on a counting rule defined by a given rhyme, which is just a sequence of words.
CF 105472B - Building Boundaries
We are given three rectangular buildings, each with fixed side lengths, and we are allowed to rotate each rectangle by 90 degrees. The goal is to place all three rectangles on a single larger axis-aligned rectangle such that they do not overlap.
CF 105472C - Cocoa Coalition
We are given a rectangular chocolate bar made of unit squares arranged in an n by m grid. We repeatedly take a single rectangular piece and split it into two smaller rectangles by making one straight cut, either horizontally or vertically.