Dear Codeforces community,
We are excited to invite you to TOKI Regular Open Contest (TROC) #14!
- Contest links: Div 1 (rating ≥ 2000) and Div 2 (rating ≤ 1999)
- Time: 5 September 2020, 12:05 UTC
- Writer: steven.novaryo
- Duration: 2 hours
- Problems: 6 for every division
- Div 2: 100 — 200 — 300 — 300 — 400 — 550
- Div 1: 100 — 100 — 200 — 350 — 450 — 600
I would like to thank prabowo as coordinator, hocky for helping with problem preparation, fushar as organizer, wiwitrifai and nyab as testers, and Yoshiyuki as proofreader.
Please register to the contest, and we hope you will enjoy TROC #14!
UPD: Contest is over! Our top 5:
Editorial is available here (English on page 8).
You can upsolve the problems here.
Thank you for participating and see you on the next contest!
But is it rated?
Yes. It is rated for both Div1 and Div2.
Why I can not register?(When I fill the information completely,click the button and no response.While,I try to click the login button and it is valid.)
As a tester, I am glad to see this wonderful masterpiece before most people could! Good luck to everyone!
The contest will start in 2 hours, good luck and have fun for everyone. ^_^
How to solve Div.2 F? Anyone, to help with the English version of editorial?
Have you tried to read the english version of the editorial? (it's in page 8)
if you tried and still don't understand you can msg me.
Thank You :) .
what's wrong in my submission of D. I think my logic is correct but it's giving WA please help
Submissions are not open to everyone in TLX. Can you send a pastebin link instead?
Edit: wait, I'm a tester. I should be able to open it lol
here is my submission
please check it once, I couldn't able to find mistake for 1 hour.
Your code fails on this testcase:
The output should be
1000000000000262143whilst your code outputs
I believe this is due to the usage of
(1 << i)in your code instead of
(1LL << i)
Also, I would recommend avoiding log2 and using a constant like
60or something instead.
Thank you very much for the help
Thanks for the contest:) It would be probably better to increase constrains on $$$F$$$, as $$$O(NQ)$$$ solution passes quite easily.
Mind sharing your code? I did HLD ($$$O(\log^2N)$$$ per update and $$$O(\log N)$$$ per query).
Also seems that rqi's code for F passes comfortably when he resubmitted it after the contest ...
Code. This is not the most straightforward solution, but still $$$O(NQ)$$$. Actually I just did what described here.
We intend to let $$$O((N+Q) \sqrt Q)$$$ solution to pass, hence the current constraint and time limit.
Our $$$O(NQ)$$$ solution took ~10s to pass, so we were quite surprised by how fast your $$$O(NQ)$$$ solution runs :)
Can someone plz help me in div2D problem. I have used the same logic as the editorial but getting a WA. Link
Your code failed on this testcase :
The output should be
3but yours outputted
can you check my code I checked at your TC, mine output is correct(3).
Auto comment: topic has been updated by steven.novaryo (previous revision, new revision, compare).
Very nice visual explanations :)
Fun fact: I made that with Microsoft Powerpoint.