2019-2020 Russia Team Open, High School Programming Contest (VKOSHP 19)
12 problems from 2019-2020 Russia Team Open, High School Programming Contest (VKOSHP 19) (contest 102443), difficulty -. 12/12 solutions verified against sample I/O.
2019-2020 Russia Team Open, High School Programming Contest (VKOSHP 19)
Special | 12 problems | 12/12 verified | Difficulty - | 1h 10m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Attractive Flowers | 4m 33s | ✓ | |||
| B | Blocking the View | 2m 3s | ✓ | |||
| C | Fermat's Last Theorem | 4m 13s | ✓ | |||
| D | Guess the Path | 5m 13s | ✓ | |||
| E | Hide-and-Seek for Robots | 8m 5s | ✓ | |||
| F | Isosceles triangles | 1m 26s | ✓ | |||
| G | Too Many Hyphens | 1m 50s | ✓ | |||
| H | Planet Nine | 7m 59s | ✓ | |||
| I | Dates | 10m 25s | ✓ | |||
| J | Factory | 7m 48s | ✓ | |||
| K | RotationAlmostSort | 14m 57s | ✓ | |||
| L | Time Travel | 1m 46s | ✓ |
CF 102443F - Isosceles triangles
A regular polygon has all vertices equally spaced around a circle. We must count every triangle whose three vertices come from the polygon and whose side lengths contain at least one equal pair. The key difficulty is that the polygon can have as many as 10 9 vertices.
CF 102443H - Planet Nine
The register starts at a and must end at b. There are only two kinds of events. An addition increases the register by a positive multiple of 9, while a deletion removes some leading decimal digits, and every removed digit must be 1.
CF 102443K - RotationAlmostSort
We have an (ntimes n) grid of arbitrary numbers. We are not given the numbers themselves. Instead, we must print a fixed program that will work correctly for every possible initial grid. A program instruction compares two cells.
CF 102443J - Factory
We are given an (m times n) rectangular map. A cell is either a workshop, written as , or empty, written as .. All workshop cells form one side-connected region, and there are no enclosed empty regions inside it.
CF 102443C - Fermat's Last Theorem
The program considers every quadruple (a, b, c, n) of positive integers with n = 3. Its ordering has two levels. First, quadruples are grouped by the largest value among their four coordinates. Inside one such group, they are sorted lexicographically by (a, b, c, n).
CF 102443G - Too Many Hyphens
We have a string made only of + and -. We may insert curly braces anywhere, without changing the original characters.
CF 102443A - Attractive Flowers
For every flower type, the bouquet can contain some number of flowers of that type, and whenever a type is used, its chosen count must be odd. We want the largest possible total number of flowers.
CF 102443L - Time Travel
There are n cities and t historical road configurations. Configuration i describes exactly which bidirectional roads existed at that historical moment. During the journey, the time machine sends us through a fixed sequence of k configurations, a1, a2, ..., ak.
CF 102443I - Dates
Each input line describes one date, but the order of its components depends on the separator. A dot means the European-style order day.month.year, while a slash means the American-style order month/day/year. The task is not to decide whether the date is a real calendar date.
CF 102443E - Hide-and-Seek for Robots
We have an (mtimes n) grid. A robot occupies some cells, and every robot points in one of four cardinal directions. A robot looking down sees a widening triangular region: one cell immediately below it, then three cells two rows below, then five cells three rows below, and so on.
CF 102443D - Guess the Path
We have an (mtimes n) grid. A hidden monotone path starts at ((1,1)), ends at ((m,n)), and uses only moves down and right. Every cell of that hidden path contains a detector. We may send a monotone path of our own as a query.
CF 102443B - Blocking the View
For each test case, we have two non-intersecting line segments, called (a) and (b), together with a non-zero direction vector (vec v). We need to decide whether some point (A) on (a) can move from (A) in the direction of (vec v) and hit some point (B) on (b).