Цикл Интернет-олимпиад для школьников, Сезон 2019-2020, Первая командная олимпиада
10 problems from Цикл Интернет-олимпиад для школьников, Сезон 2019-2020, Первая командная олимпиада (contest 102373), difficulty -. 5/10 solutions verified against sample I/O.
Цикл Интернет-олимпиад для школьников, Сезон 2019-2020, Первая командная олимпиада
Special | 10 problems | 5/10 verified | Difficulty - | 53m 29s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u041e\u043d\u043e | 57s | ✓ | |||
| B | Wooden Castle | 2m 23s | ||||
| C | Diamonds | 8m 39s | ✓ | |||
| D | Good Subset | 3m 26s | ||||
| E | Checkered Pattern | 9m 47s | ||||
| F | \u041e\u043d\u0438 | 2m 3s | ||||
| G | \u041d\u043e\u0436\u043d\u0438\u0446\u044b | 5m 50s | ✓ | |||
| H | Escape from the Abundoned House | 7m 36s | ✓ | |||
| I | \u0417\u0432\u0443\u043a\u0438 \u0432 \u043f\u043e\u0434\u0432\u0430\u043b\u0435 | 4m 15s | ✓ | |||
| J | Transformations | 8m 33s |
CF 102373J - Transformations
We have two permutations of the same friends. The current line is a, and the required line is b. One reorganization chooses any nonempty set of friends, removes them from their current positions, reverses their relative order, and puts the reversed subsequence at the very front.
CF 102373F - Они
We have an array a[1..n], where a[i] is the number of children at position i. The old Pennywise takes a prefix, positions 1 through l, while the modern Pennywise takes a suffix, positions r through n. The two segments must not overlap, so l < r.
CF 102373E - Checkered Pattern
We have an (n times m) rectangular board whose cells are either black or white. After changing any number of cells, the black cells must form a nonempty connected graph, where cells sharing a side are adjacent, and that graph must contain no cycle.
CF 102373A - Оно
We have two lowercase strings, s and t. We need to count nonempty substrings of s whose letters can be taken from t. The order of the letters does not matter, because we only care whether t contains enough copies of every character appearing in the chosen substring.
CF 102373B - Wooden Castle
We have a tree whose vertices are colored with two colors, represented by 0 and 1. We may either flip the color of one still-existing vertex, paying one operation, or choose a vertex and destroy the entire connected component of its current color containing that vertex, also…
CF 102373I - Звуки в подвале
We have a strip of cells, each colored either R or B. A move can be made on any current strip whose two endpoint colors are different. The move chooses a cut between two cells and splits that strip into two nonempty strips.
CF 102373H - Escape from the Abundoned House
The grid is a graph whose vertices are all non-wall cells, with edges between cells sharing a side. The friends start at s and need to reach f. Every horizontal move changes the temperature by -1, regardless of whether the move goes left or right.
CF 102373G - Ножницы
We have a rectangular sheet divided into n × m unit cells. Bill cuts only along grid lines and follows a fixed right-turning spiral.
CF 102373D - Good Subset
We have an array of (n) positive integers. We may choose any subset of its elements, and the subset is considered good when the greatest common divisor of all chosen values is greater than (1). The task is to find the maximum possible number of elements in such a subset.
CF 102373C - Diamonds
We have a simple undirected graph with up to 300,000 vertices and 300,000 edges. A diamond consists of two different triangles that use the same edge. If an edge has several vertices connected to both of its endpoints, every pair of those common neighbors forms one diamond.