Eolymp Cup #3
Get ready for the third round of the Eolymp Cup happening on Sunday, December 15! Compete for a chance to win free HSU scholarships, Eolymp subscriptions, and our exclusive Evil Chmyaaax T-Shirt. Don’t miss out on the action—we’re excited to see you there!
About
Eolymp Cup is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming.
The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially.
Format and Duration
In each round, you are given 3.5 hours to solve 6 problems. Each problem is split into sub-tasks, which represent part of the problem. The points are awarded by sub-task, meaning you have to solve an entire sub-task to get points.
Registration
You can register on the contest page, just click "Join" on the top of the page.
Thanks a lot to:
Denisov for coordinating the contest
Sergey Kolodyazhnyy for creating Eolymp
waipoli, Do_not_make_friends, Denisov, BalashovIvan for authoring the problems
peltorator, TimDee, Triseedot, Ignut, FBI, SashaT9, Pa_sha for testing the contest
Prizes
The winners of the competition, based on the results of all rounds, will receive a trophy, medals and valuable prizes.
- 1st prize: The absolute winner will receive the Eolymp Cup trophy, first-place medal and Apple MacBook Air 13".
- 2nd prize: The participant ranked second will receive the first-place medal and an Apple iPad Air 11" tablet computer.
- 3rd prize: The participants ranked 3-6 will receive second-place medals and an Apple Watch SE smartwatch.
- 4th prize: Participants ranked 7-12 will receive third-place medals and Keychron K8 Wireless keyboard.
Additionally, the top-12 participants and 25 randomly selected participants in top-250 will receive exclusive T-Shirts and stickers.
Get scholarship at Harbour.Space University
Harbour.Space University is a private international university focused on Technology, Business and Design with campuses in Barcelona (Spain) and Bangkok (Thailand). HSU places a strong emphasis on its connection to the tech industry and works closely with industry experts across the world to immerse students in a dynamic, multi-cultural ecosystem of education, professional experience, and networking with like-minded peers and actively practicing professionals. In April 2024, Harbour.Space University won the Gold Medal in ICPC World Final, outcompeting such universities as MIT, Stanford, Oxford, Cambridge, among others.
Scholarship
In each round, the Top-3 participants as well as 2 randomly selected participants among the Top-50 will receive a full scholarship at Harbor.Space University, which includes:
- Full Tuition Fee Coverage: EUR 19,900 for Bachelor's programs or EUR 22,900 for Master's programs
- Program Choice: all programs of HSU across tech, business, and design are in scope
- Campus Choice: choose to study in one of HSU’s campuses in two vibrant cities, in Barcelona or Bangkok
- Internship opportunities: you will also be offered to join Talent Pool of Harbour.Space University and be considered for paid internship opportunities from university’s industry partners
Important
If you're interested in receiving a scholarship, please be sure to mark "Apply for scholarship at Harbor.Space University" during registration.
Free 3-week course
All competition participants will also have an exclusive opportunity to register for a Raffle. The 5 lucky winners will receive a free 3-week course of their choice at HSU, see schedule.
Register for a Ruffle
Win free Eolymp subscriptions
Based on the results, we will create an additional rating among educational institutions. After each round, the top 10 institutions as well as 10 randomly selected institutions among these who scored at least 100 points, will be awarded a coupon for Eolymp Competition Platform. The coupon will give a 100% discount for Advanced plan for the first 6 months with up to 100 seats.
The students should specify a university or a school they are representing during the registration process. Despite its name, the ranking includes all educational institutions: universities, schools, colleges etc. The institutions are ranked based on the total number of points scored by their students.
Pinely
This round is sponsored by Pinely.
Pinely is a dynamic algorithmic trading firm, privately owned & funded, with a presence in Singapore, the Netherlands, and Cyprus. We specialize in high-frequency and ultra-low latency trading, striving to be among the top trading companies worldwide.
Our team tackles everyday challenges like developing trading strategies, optimizing systems for minimal latency, saving and processing large volumes of historical data.
Our flat structure and collaborative environment make everyone feel heard and cultivate a culture fueled by ideas and a love for innovation.
We are a team of mathematicians, programmers, engineers, and computer scientists, united by a passion for knowledge. Our work demands exceptional C++ coding, algorithmic thinking, and mathematical intuition, attracting top talent, including winners and awardees of such respective challenges as ICPC, IMC, HITB PRO CTF, Google HashCode, etc.
To join our team, please send your CV to [email protected].
Visit pinely.com
The original Eolymp blog could be found here.
GM round
TimDee ORZ.
Btw, since you are a tester, do you recommend participating?
Yes, definitely! I love Eolymp Cup.
Sounds interesting, will try to find time to participate.
Isn't the contest duration is 3.5hours?
Fixed, thank you
Clashes with Turkish NOI :(
Skip NOI 😱
Seems optimal.
Mr.whitebird or Mr.whiteboard
Great idea now that new year's round the corner! :D
Reminder: The contest will already be hosted tomorrow!
Reminder: The contest will start in one hour!
Thank you for the contest, the tasks were extremely interesting (for my level). Any hints on how to get full points on D? I received 57 points, but I don't have any idea of how this can be improved to the full solution.
Origin of problem D
In all seriousness, in my solution, you can calculate the value of some y_i for some state of the current bitwise trie as follows:
If you have to solve some subtree of the trie and you can only xor with at most $$$A$$$, and:
if(left or right >= 2^bit) return left + right; else return max(left, right);)Isn't problem C basically the same problem as RMI 2020 Sum zero?
How to get more than 78 in problem E?
To determine the degree of a vertex $$$p_i$$$ among the vertices $$$p_1, \dots, p_{i-1}$$$, we can use a query. By leveraging the permutation and its reverse, we can compute the degree of each vertex.
Next, we iteratively identify a leaf, find its neighbor, and remove it from consideration. For any given leaf, based on multiple random permutations, we know that its neighbor must either be immediately to its left or right in at least one of these permutations. By intersecting these candidate sets across all permutations, we can uniquely identify the true neighbor.
If we use $$$q-2$$$(2 queries was used to identify the degree) random permutations, the probability of incorrectly identifying a non-neighbor as the true neighbor decreases exponentially, specifically to $$$1/2^q$$$. Thus, with $$$q = 50$$$, the probability of error becomes negligible.
There is also a deterministic solution in $$$2 × log_2(N * 2)$$$, which uses the same means to determine degree, only that we'd query for how many neighbours have some bit on. Then, with this information, each leaf could only point to one other node, so we could get all the edges by removing leaves one by one.
Is there any editorial available?