Открытый чемпионат ЯрГУ им. П.Г. Демидова Demidov Open IT Cup 2019
10 problems from Открытый чемпионат ЯрГУ им. П.Г. Демидова Demidov Open IT Cup 2019 (contest 102786), difficulty -. 7/10 solutions verified against sample I/O.
Открытый чемпионат ЯрГУ им. П.Г. Демидова Demidov Open IT Cup 2019
Special | 10 problems | 7/10 verified | Difficulty - | 10m 23s
CF 102786B - Беги, Семен, беги
Semyon chooses his running days by a simple calendar rule. His first training happens on an odd day of some month, and after that he keeps running on every odd-numbered day.
CF 102786C - Разящий удар звездного десанта
The task is an interactive graph reconstruction problem. We start in hall 0, and at the beginning halls 0 through N are already reachable. After that, drones repeatedly send fragments of discovered tunnels. Each fragment contains several undirected edges between hall numbers.
CF 102786J - Путешествие КORовьева
I will provide the editorial as a complete document. Edit We have an undirected road network. Each house is a vertex, each road is an edge, and every road has an integer label.
CF 102786I - Проблема свободного места
Edit We have a row of n goods, represented by an array of weights. The row changes over time: each query swaps the elements at two positions. After every swap, we must determine whether the whole array is sorted in nondecreasing order.
CF 102786H - NP-Слон
I can write the editorial, but the statement data appears inconsistent: the displayed sample for input 2 1 shows output 3, while the mathematical properties of the stated graph imply the minimum possible cycle cost is 2 for n = 2.
CF 102786G - Timestamp
The clock displays a ten-digit timestamp. At any moment, every digit consumes a fixed amount of energy per second depending on which digit is shown. The display starts at timestamp 0000000000, then increases by one every second.
CF 102786F - Бобслей. Версия 2022
I can write the editorial, but the statement’s central inequality was corrupted during copying, so the exact operation being counted is ambiguous. Please provide the original formula or a screenshot/text of that line. Waiting for your answer
CF 102786E - Упорядочивание по сумме цифр
We need to look at all positive integers from 1 to N, but the ordering is unusual. Numbers are grouped by the sum of their decimal digits. A group with a smaller digit sum appears earlier, and inside one group the numbers are sorted normally by value.
CF 102786D - Бычий рынок
The input describes the daily percentage changes of an asset price. Each value is given in basis points, so a value of 100 means a change of 1%, -250 means a decrease of 2.5%, and so on. The price changes are applied one after another, which means they multiply rather than add.
CF 102786A - Ханой де Пари
I’m not able to provide a reliable editorial for this problem right now because I have not derived and verified the constructive algorithm that satisfies the move limit for all N ≤ 100.