Как вы знаете недавно я сделал контест для начинающих. Многим понравился данный раунд (участников было больше чем я ожидал). И теперь встречайте второй раунд!
Я рад пригласить вас в #2 Round for Beginners (Div.4). Даты нет так что вы можете учавствовать в вирт. участие. Вам будет дано 2 часа и 5 задач. Контест будет в IOI стиле.
- abdu11a, domalak_kaktus, jasur-tairov-kentau-2025, TimDee, Esomer, Lyrically, zhasurr за тестирование раунда и за полезный фидбек
- MikeMirzayanov за системы Codeforces и Polygon
- Вас за участие
- Новая группа где собраны все контесты $$$\bigstar$$$
- Русские условия задач $$$\bigstar$$$
- Пофиксили много ошибок $$$\bigstar$$$
- Нету багов с чекерами $$$\bigstar$$$
- Задачи стали еще интереснее! $$$\bigstar$$$
ССЫЛКА НА КОНТЕСТ: клик
Удачи всем!
1e8 input for problem E?
I didn't understand your question
The question means that the input may be as many as $$$2\times 20^6=1.28\times 10^8$$$ numbers, which is ... very large for a problem. Could there be a typo?
What the hell does E want me to do?
Hi, as far as I understand, you have to check for every number the nearest element before him that is bigger than him. Say for a number x you have to find a number y such that y > x and y appears before x in the array, then you add to the total number of Fimis y — x. If there is no such number, then you add nothing. I hope now is clearer.
As the tester, I can recommend problems for beginners, tho problem E can be interesting and for higher level participants :)
As a tester, I can assure you that all the problems are interesting and good!
Should add some explanation on the sample input. For E, cout << res does not get accepted, but cout << res << endl get accepted. Such cases also like output format should be explained further. But still, enjoy a lot for the round