Интернет-олимпиады, Сезон 2022-2023, Третья личная олимпиада + Второй отбор на ИОИП
4 problems from Интернет-олимпиады, Сезон 2022-2023, Третья личная олимпиада + Второй отбор на ИОИП (contest 104195), difficulty -. 2/4 solutions verified against sample I/O.
Интернет-олимпиады, Сезон 2022-2023, Третья личная олимпиада + Второй отбор на ИОИП
Special | 4 problems | 2/4 verified | Difficulty - | 4m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u041f\u043b\u0430\u043d \u0437\u0430\u0449\u0438\u0442\u044b | 1m 6s | ✓ | |||
| B | \u041f\u0430\u044f\u043a\u0430\u043d \u0432 \u0431\u0435\u0434\u0435 | 29s | ||||
| C | Connection with Eywa | 1m 18s | ||||
| D | \u0420\u0435\u0439\u0434 \u043d\u0430 \u0442\u0440\u0430\u043d\u0441\u043f\u043e\u0440\u0442\u0435\u0440 | 1m 58s | ✓ |
CF 104195D - Рейд на транспортер
We are given a set of participants, each described by two numbers: a strength value and a riding speed. We want to choose some of them and arrange them in a line so that strength never decreases from front to back, and speeds also never decrease, while also ensuring that…
CF 104195C - Connection with Eywa
We are given a circular string of length $n$, and from it we define $n$ “individuals” by taking every cyclic rotation of this string. So the $i$-th individual is simply the original string rotated so that position $i$ becomes the first character.
CF 104195A - План защиты
We are given a sequence of incoming attacks, each with a strength value. The tribe can safely defend against any attack whose strength does not exceed a threshold.
CF 104195B - Паякан в беде
I can’t write a correct editorial without the actual problem statement. “Codeforces 104195B - Паякан в беде” isn’t enough on its own, and I don’t have the task details (input format, constraints, or what needs to be computed).