ЛКШ 2019, Июль, Микс старшей и младшей олимпиад

13 problems from ЛКШ 2019, Июль, Микс старшей и младшей олимпиад (contest 102284), difficulty -. 10/13 solutions verified against sample I/O.

13 items

ЛКШ 2019, Июль, Микс старшей и младшей олимпиад

Special | 13 problems | 10/13 verified | Difficulty - | 1h 13m

# Problem Rating Tags Accepted Time ✓
A \u0427\u0442\u043e? \u0413\u0434\u0435? \u041a\u043e\u0433\u0434\u0430? 1m 26s
B \u0411\u043e\u043b\u044c\u0448\u0438\u0435 \u0447\u0430\u0441\u044b \u0438 \u043c\u0430\u043b\u0435\u043d\u044c\u043a\u0430\u044f \u043e\u043a\u0440\u0443\u0436\u043d\u043e\u0441\u0442\u044c 2m 21s ✓
C \u0411\u0430\u0441\u043a\u0435\u0442\u0431\u043e\u043b\u044c\u043d\u0430\u044f \u0437\u0430\u0440\u044f\u0434\u043a\u0430 14m 8s ✓
D \u041a\u0440\u0430\u0441\u0438\u0432\u044b\u0435 \u043c\u0435\u043b\u043e\u0434\u0438\u0438 5m ✓
E \u041f\u043e\u0434\u0432\u043e\u0434\u043d\u0430\u044f \u043b\u043e\u0434\u043a\u0430 \u0432 \u0420\u044b\u0431\u0438\u043d\u0441\u043a\u043e\u043c \u043c\u043e\u0440\u0435 2m 54s ✓
F \u041a\u043b\u0443\u0431 \u0430\u043d\u043e\u043d\u0438\u043c\u043d\u044b\u0445 \u0433\u0435\u043e\u043c\u0435\u0442\u0440\u043e\u0432 1m 19s ✓
G SIS 22m 48s
H \u041c\u0443\u0437\u044b\u043a\u0430\u043b\u044c\u043d\u044b\u0439 \u0444\u0440\u0435\u0448 10m 12s ✓
I OpenStreetMap 2m 14s ✓
J \u0413\u0440\u0438\u0448\u0430 \u043f\u043e\u0441\u043b\u0435 \u0434\u0438\u0441\u043a\u043e\u0442\u0435\u043a\u0438 1m 43s ✓
K \u041f\u0440\u0438\u0448\u0451\u043b \u0414\u0435\u043c\u0438\u0434 \u0438 \u0432\u0441\u0451 \u043f\u0440\u043e\u0432\u0435\u0440\u0438\u043b 3m 21s ✓
L \u0412\u044b\u0431\u043e\u0440 \u0432\u0435\u0447\u0451\u0440\u043a\u0438 3m 12s ✓
M \u0422\u0440\u0438\u0441\u043a\u0430\u0439\u0434\u0435\u043a\u0430\u0444\u043e\u0431\u0438\u044f 2m 35s
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284G - SIS

We receive the switches one by one. Switch i has an integer label a[i], and if two switches with labels x and y are connected, that channel costs x XOR y.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284H - Музыкальный фреш

We have an array of $N$ songs. Song $i$ normally has volume $Hi$, and lowering its volume by one unit costs $Ai$ units of event success. The teachers need a period of exactly $M$ consecutive minutes during which the volume is constant.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284C - Баскетбольная зарядка

We have two rows of (n) students. Student (i) in the first row has height (ai), and student (i) in the second row has height (bi). A team is formed by taking students from left to right, so the indices of chosen students must be strictly increasing.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284B - Большие часы и маленькая окружность

The archived Codeforces contest lists problem B as «Большие часы и маленькая окружность», with a 2 second time limit and 512 MB of memory.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284M - Трискайдекафобия

We need to work with the increasing sequence of all positive integers whose prime factors belong to the fixed set {2, 3, 5, 7, 11}. Such numbers can be written exactly as [ 2^a3^b5^c7^d11^e, ] where all five exponents are nonnegative integers.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284L - Выбор вечёрки

There are (n) students, and each student names one of (k) possible drinks. Andrew has exactly (lceil n/2rceil) packages. Each package contains two half-portions, so one package can satisfy at most two students, and both of those students must have requested the same drink.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284K - Пришёл Демид и всё проверил

We have a queue of (N) packages. Each package belongs to one of four groups, represented by the digits 6, 7, 8, and 9. Reading the groups from left to right gives the number whose value defines the beauty of the queue.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284J - Гриша после дискотеки

We have Grisha's string s, and a collection of letter cards represented by another string t. Every character of t corresponds to one physical card, so only the number of available copies of each letter matters.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284I - OpenStreetMap

We have an (n times m) height map. The browser can display any rectangle containing exactly (a) consecutive rows and (b) consecutive columns. For every possible position of that rectangle, we need its minimum height, and finally we need the sum of all those minima.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284F - Клуб анонимных геометров

We have (n) convex polygons. Polygon (i) is given by its vertices in counterclockwise order, and the total number of vertices across all polygons is at most (300,000). For every query ([l,r]), we need the number of vertices of the Minkowski sum of polygons (l,l+1,ldots,r).
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284E - Подводная лодка в Рыбинском море

We have an array of up to (10^5) positive integers, and for every ordered pair of elements (ai,aj) we form a new decimal number by interleaving their digits from the least significant side. If one number has more digits, its remaining most significant digits stay in front.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284D - Красивые мелодии

We have an array of (n) note frequencies. We may choose any nonempty subsequence, so the chosen positions have to remain in their original order, but positions may be skipped.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › ЛКШ 2019, Июль, Микс старшей и младшей олимпиад ›

CF 102284A - Что? Где? Когда?

I can write the editorial, but there is a problem with the supplied problem data: Codeforces Gym 102284A is indeed “Что? Где? Когда?
codeforces competitive-programming Aug 13, 2026