Интернет-олимпиады, Сезон 2019-2020, Третья командная олимпиада, усложненная номинация
11 problems from Интернет-олимпиады, Сезон 2019-2020, Третья командная олимпиада, усложненная номинация (contest 102420), difficulty -. 8/11 solutions verified against sample I/O.
Интернет-олимпиады, Сезон 2019-2020, Третья командная олимпиада, усложненная номинация
Special | 11 problems | 8/11 verified | Difficulty - | 1h 37m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u0417\u0430 \u0433\u0440\u043e\u0431\u043e\u0446\u0432\u0435\u0442\u0430\u043c\u0438 | 19m 1s | ✓ | |||
| B | \u0421\u0438\u043b\u044c\u043d\u0430\u044f \u0433\u0440\u0443\u043f\u043f\u0430 | 10m 9s | ✓ | |||
| C | \u041b\u043e\u0432\u0443\u0448\u043a\u0430 \u0441\u043e \u0441\u0432\u0435\u0447\u043a\u0430\u043c\u0438 | 42m 9s | ||||
| D | Spell | 3m 2s | ✓ | |||
| E | \u041b\u0435\u043d\u0438\u0432\u044b\u0435 \u043b\u0435\u0441\u043e\u0440\u0443\u0431\u044b | 2m 2s | ✓ | |||
| F | Arithmetic and blocks | 4m 36s | ✓ | |||
| G | Tennis score | 5m 37s | ||||
| H | Wedding | 1m 51s | ✓ | |||
| I | Sum of Maximums | 2m 49s | ✓ | |||
| J | \u041c\u0430\u043b\u0435\u0444\u0438\u0441\u0443\u043c\u043c\u0430 | 1m 46s | ✓ | |||
| K | Magical XML | 3m 59s |
CF 102420I - Sum of Maximums
We have (n) positions in an array, but the values assigned to those positions are not fixed. For each attempt, we receive (n) values and may permute them however we want. There are (q) fixed intervals on the array.
CF 102420H - Wedding
We have a changing set of fairies. Initially there are n fairies, numbered from 1 through n, and fairy i has an integer sociability value a[i]. During the observation there are q events. A type 1 event adds a new fairy.
CF 102420K - Magical XML
The input is one string containing only lowercase letters and the three structural characters <, and /. We may arbitrarily permute all characters, but we cannot change their multiplicities. A valid result is a sequence of XML-like tags.
CF 102420B - Сильная группа
У нас есть дерево из n комнат. В каждой комнате находится один эльф с силой w[i].
CF 102420C - Ловушка со свечками
We have a cyclic array of n candles. Each position contains one of three colors, R, Y, or B. A move may recolor position i, but only when the two neighboring positions, i - 1 and i + 1, currently have different colors. The new color of position i can be chosen arbitrarily.
CF 102420J - Малефисумма
We have an array of (n) nonnegative integers (a1,a2,ldots,an). We need the sum of the products of every three distinct elements, where the indices must satisfy (i<j<k): [ sum{1le i<j<kle n} ai aj ak.
CF 102420G - Tennis score
Searching the web
CF 102420F - Arithmetic and blocks
We have (n) physical cubes. Each cube can display any digit that appears on one of its six faces, but a cube can display only one digit at a time. To build a number, Aurora chooses as many cubes as the number has digits and assigns one distinct cube to every digit position.
CF 102420E - Ленивые лесорубы
We have an ordered sequence of (n) lumberjacks. Lumberjack (i) works on one interval ([li,ri]), and on that interval he lowers the wall by exactly half a meter.
CF 102420D - Spell
We have two positive integers, a and b, given as decimal strings, and we consider every integer from a through b. We multiply all of them together, then repeatedly replace the resulting number by the sum of its decimal digits until only one digit remains.
CF 102420A - За гробоцветами
We have (n) hunters, and each hunter occupies a distinct point ((xi,yi)) on the plane. We need to choose three different hunters whose positions do not lie on one straight line. If such a triple exists, we print Yes and their indices.