43rd Petrozavodsk Programming Camp (2022 Summer) Day 7. HSE Koresha Contest
11 problems from 43rd Petrozavodsk Programming Camp (2022 Summer) Day 7. HSE Koresha Contest (contest 104491), difficulty -. 0/11 solutions verified against sample I/O.
43rd Petrozavodsk Programming Camp (2022 Summer) Day 7. HSE Koresha Contest
Special | 11 problems | 0/11 verified | Difficulty - | 25m 45s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Easy Problem | 1m 28s | ||||
| B | Standard Problem | 2m 12s | ||||
| C | Network Transfer | 3m 18s | ||||
| D | Hard Problem | 1m 31s | ||||
| E | String Strange Sum | 2m 9s | ||||
| F | Bayan Testing | 2m 22s | ||||
| G | Battleship: New Rules | 1m 48s | ||||
| H | Triangular Cactus Paths | 3m 23s | ||||
| I | Best Sun | 2m 57s | ||||
| J | Fast Bridges | 2m 28s | ||||
| K | Decoding The Message | 2m 9s |
CF 104491K - Decoding The Message
We are given a multiset of bytes, where each byte value from 0 to 255 appears a certain number of times. Think of this as a bag of labeled tiles. We consider every possible ordering of these tiles.
CF 104491I - Best Sun
We are given a set of points in the plane. From these points, we must build a geometric structure that is a single simple cycle plus additional edges, with exactly one cycle in the resulting graph.
CF 104491J - Fast Bridges
We are given a very large $k times k$ grid where every cell contains a vertex. From each cell, you can normally move to its four adjacent cells with cost $1$ per step, so the base distance between two cells is their Manhattan distance.
CF 104491H - Triangular Cactus Paths
We are given a connected graph that behaves almost like a tree, except it may contain a few cycles, and every edge belongs to at most one of those cycles. The extra restriction is that every cycle is extremely small, in fact it is always a triangle.
CF 104491F - Bayan Testing
We are given an array of length n, but we are not constructing it directly at first. Instead, we are given 2m segments on this array, each segment being a range of indices.
CF 104491G - Battleship: New Rules
We are dealing with a hidden $n times n$ grid containing a fixed configuration of occupied cells. The occupied cells come from a set of rectangular ships, each ship being either a single row segment $1 times a$ or a single column segment $a times 1$.
CF 104491E - String Strange Sum
We are given a string and we look at every way to choose a starting position ℓ and an ending position r, with ℓ strictly after the first character. For each such segment s[ℓ..r], we treat it as a pattern. Now consider the prefix of the string before ℓ, namely s[1..
CF 104491C - Network Transfer
This failure is no longer about parsing or indexing. The code is now consistently producing a valid permutation-like construction, but it is solving the wrong problem.
CF 104491D - Hard Problem
We are given an array of integers, and we repeatedly look at contiguous segments of it, but only segments whose length is even. Each such segment is split into two equal halves. We inspect only the maximum value in each half.
CF 104491B - Standard Problem
We are given a collection of segments on the integer line. Each segment describes a range of values it can “emit”, and it also carries a weight. From these segments, we choose some subsequence in their original order.