We are excited to invite you to TLX Regular Open Contest #41!
Key details:
Contest links: TLX
Writers: SphericalCow
Duration: 2 hours
Problems: 7
Scoring distribution: 150 — 300 — 300 — 450 — 450 — 600 — 600
We would like to thank:
- tzaph_, steven.novaryo for the help with the early stages in coordination.
- aufannn, rama_pang for testing the problems and giving meticulous feedback.
- fushar for the outstanding TLX platform.
Please register for the contest and we encourage you to read all problems! Enjoy the contest!
UPD: The contest is rescheduled to 25th November 2024, 12:35 UTC.
UPD2: Contest is over!
Congratulations to our top 5!
Congratulations to our first solvers!
A: kotatsugame
B: kotatsugame
C: HIR180
D: kotatsugame
E: kotatsugame
F: potato167
G: hos.lyric
You can upsolve the problems here. Editorials are available in the upsolve link!
Thank you for participating! See you on the next contest!
sapi berbentuk bola
Pyqe but he's a newbie
Don't judge a book by it's cover :)
Clash with 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
After the reschedule, the contest doesn't clash anymore
Thank you sir
Can anyone help me with the last line of Problem E's editorial? By using the std::set data structure, we can calculate the change in value for the sum ... in O(logQ) time complexity.
Would this not take O(Q) time since we would have to iterate over the whole set every time? Or am I missing some std::set property? Pyqe
You don't need to iterate over all elements you can just update using next greater element and next lower element.