As you know, recently I did a contest for beginners. Many people liked this round (there were more participants than I expected). And now meet the second round!
I happy to invite you to #2 Round for Beginners (Div.4). You can participate in virtual participation. You will have 2 hours and 5 problems. The contest will be in IOI style.
- abdu11a, domalak_kaktus, jasur-tairov-kentau-2025, TimDee, Esomer, Lyrically, zhasurr for testing our round and tell useful feedback
- MikeMirzayanov for systems Codeforces and Polygon
- You for participating
- New group where collected all contests $$$\bigstar$$$
- Russian statements of tasks $$$\bigstar$$$
- Fixed lot of errors $$$\bigstar$$$
- No bugs with checkers $$$\bigstar$$$
- More interesting tasks! $$$\bigstar$$$
LINK FOR CONTEST: click here
Good luck for everyone!
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