prabowo's blog

By prabowo, history, 5 years ago, In English

Dear Codeforces community,

We're excited to invite you to TOKI Regular Open Contest (TROC) #10!

Key details:

  • Rated
  • Contest links: Div 1 and Div 2
  • Time: 1 February 2020, 19:05 UTC+7
  • Style: full feedback, with penalty (time taken to reach current score) + (4-minute penalty per wrong submission)
  • Scoring: You get the score assigned to the problem when you fully solve it
  • Writers: hocky Pa.Nic phillotunru1
  • Duration: 2 hours
  • Problems: 6 for every division
  • Allowed languages: C, C++11, Pascal, Java, Python 3

The round uses two divisions system:

  • Users with rating less than 2000 or not yet rated should participate in Div 2
  • Users with rating at least 2000 should participate in Div 1

Scoring distribution:

  • Div 2: 100 — 200 — 300 — 400 — 500 — 500
  • Div 1: 100 — 200 — 300 — 300 — 450 — 500

Please register to the contest, and we hope you will enjoy TROC #10!

UPD1: Contest is over! Our Top 5:

Div 1:

  1. antontrygubO_o
  2. Egor
  3. wiwitrifai
  4. Yahor Dubovik
  5. Pyqe

Div 2:

  1. Benq
  2. nikolapesic2802
  3. nirvana
  4. buko
  5. aropan

Editorial is available here (English on page 5).

You can upsolve the problems here.

We would like to thank fushar as technical committee, and also ayaze and IgoRamli as testers.

Thank you for participating and see you on the next contest!

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

| Write comment?
»
5 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Bumpy bump! The contest will start in 15 minutes!

  • »
    »
    5 years ago, # ^ |
    Rev. 2   Vote: I like it +29 Vote: I do not like it

    Me realizing the contest will start in 5 minutes but havent typed my template yet

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

    When youre late, but still able to register and compete in the contest

»
5 years ago, # |
  Vote: I like it +19 Vote: I do not like it

Benq on Div 2:

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to do F?

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

    Editorial will be posted soon!

  • »
    »
    5 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    For Div 2. F, i just wrote an n^3 dp and looked for patterns on when B wins

    B win
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thanks. I wrote the brute force but didnt try to figure pattern. :(

»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

antontrygubO_o Congratulations!

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I think you changed order of top 2 in div 1. Though I still have no clue where's big in mitm in my F

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

    Thank you for noticing it, I fixed the top 5 order.

    For your F, it looks like you missed the case when you do not have to do modulo operation.

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

      That was last submission where I just commented out that part. Actually I have this case

»
5 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

can someone share AC code for div2D please?