steven.novaryo's blog

Invitation to TOKI Regular Open Contest #14
By steven.novaryo, history, 4 years ago, In English

Dear Codeforces community,

We are excited to invite you to TOKI Regular Open Contest (TROC) #14!

Key details:


Scoring distribution:
  • 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 yz_ 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:

Div 1:

  1. Benq
  2. maroonrk
  3. BohdanPastuschak
  4. rqi
  5. Pyqe
Rank 4 and 5 in div 1 have same score and penalty.

Div 2:

  1. tatyam
  2. dario2994
  3. tute7627
  4. Bohun
  5. m_99

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!

  • Vote: I like it
  • +183
  • Vote: I do not like it

Comments Comments (26)
| Write comment?
»
4 years ago, # |
  Vote: I like it +14 Vote: I do not like it

novaryo orz

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

But is it rated?

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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.)

→ Reply
»
4 years ago, # |
  Vote: I like it +25 Vote: I do not like it

As a tester, I am glad to see this wonderful masterpiece before most people could! Good luck to everyone!

→ Reply
»
4 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Friendly bump!

The contest will start in 2 hours, good luck and have fun for everyone. ^_^

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

How to solve Div.2 F? Anyone, to help with the English version of editorial?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    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.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

what's wrong in my submission of D. I think my logic is correct but it's giving WA please help

https://tlx.toki.id/contests/troc-14-div-2/submissions/285513

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    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

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      here is my submission

      https://ideone.com/w4ubj0

      please check it once, I couldn't able to find mistake for 1 hour.

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Your code fails on this testcase:

        3
1000000000000000000 999999999999999999 999999999999999998

        The output should be 1000000000000262143 whilst your code outputs 1000000000000000001.

        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 60 or something instead.

        Cheers!

        → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      bruh

      → Reply
»
4 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Thanks for the contest:) It would be probably better to increase constrains on $$$F$$$, as $$$O(NQ)$$$ solution passes quite easily.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +26 Vote: I do not like it

    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 ...

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +10 Vote: I do not like it

      Code. This is not the most straightforward solution, but still $$$O(NQ)$$$. Actually I just did what described here.

      → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    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 :)

    → Reply
»
4 years ago, # |
  Vote: I like it +9 Vote: I do not like it

Can someone plz help me in div2D problem. I have used the same logic as the editorial but getting a WA. Link

→ Reply
»
4 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Auto comment: topic has been updated by steven.novaryo (previous revision, new revision, compare).

→ Reply
»
4 years ago, # |
  Vote: I like it +22 Vote: I do not like it

Very nice visual explanations :)

→ Reply
»
4 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Happy contest

→ Reply