Блог пользователя YouKn0wWho

Автор YouKn0wWho, 4 года назад, По-английски

Hi!

I am thrilled to invite you to participate in CodeChef’s October Cook-Off, this Sunday, October $$$18$$$, from 9:30 pm to 12:00 am IST.

Followings are the basic information:

  • Participants in each division will be given $$$6$$$ problems and $$$2.5$$$ hours to solve them.
  • All problems have been cooked by me.
  • Statements are very short unlike this announcement!
  • Problems will have strong samples.
  • There will be an interactive problem in this round, so, you should know how to deal with them.
  • I hope your internet connection is good as some of the problems will feature awesome animations that I have created using Manim! Yeah, it means the problems will have better explanations.
  • In my last contest, only $$$103$$$ div2 participants managed to solve div2C which is not good at all. So this time I have tried to maintain a more balanced difficulty distribution.
  • I would like to thank teja349 for his brilliant coordination of this round.
  • amnesiac_dusk tasted the problems(I hope they taste sweet!). I want to thank him particularly for helping me with the preparation of a few problems.
  • Psychik is in charge of the editorials.
  • Needless to say, Xellos did the statement improvements.
  • Video Editorialists: Chirayu, agarwal19,darshancool25, manijuana, divesh2201
  • Translators: Mediocrity [Russian], Team VNOI [Vietnamese], solaimanope [Bengali], devils_code [Hindi], qingczha [Mandarin]

Prizes: The top $$$10$$$ Indian and top $$$10$$$ Global participants will receive CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here.

The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.

Good luck!

  • Проголосовать: нравится
  • +140
  • Проголосовать: не нравится

»
4 года назад, # |
  Проголосовать: нравится -10 Проголосовать: не нравится

Clashing with CF Round 676

  • »
    »
    4 года назад, # ^ |
    Rev. 2   Проголосовать: нравится -14 Проголосовать: не нравится

    The blog has been revised, and I look like a fool...

  • »
    »
    4 года назад, # ^ |
    Rev. 2   Проголосовать: нравится +104 Проголосовать: не нравится

    Trust me I am the one who is more concerned about the clash. I have already discussed it with the CodeChef authority but here is the reason they stated explicitly: It's because we've been having these contests at the same slot for many years, and that predictability is pretty important for the platform. We then wrote to MikeMirzayanov explaining the situation and we are hoping that he'll get back with some good news. He usually takes time to reply to emails, so fingers crossed! That said, in the worst case, we would be having clashing contests

    • »
      »
      »
      4 года назад, # ^ |
      Rev. 2   Проголосовать: нравится +97 Проголосовать: не нравится

      UPD: MikeMirzayanov has just replied to the email and the div2 contest has been rescheduled. We, as a community, are thanking the CF authority for showing such a great gesture. Hopefully, now you can participate in both contests and enjoy the beauty of them.

»
4 года назад, # |
Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

CF round is rescheduled, now we can participate in both CC and CF, Thank you Mike

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

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

»
4 года назад, # |
  Проголосовать: нравится +12 Проголосовать: не нравится

some of the problems will feature awesome animations that I have created

This is probably the first time a problem statement will have animations to help with the explanation. What a time to be alive!

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

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

»
4 года назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

Are problems sorted by expected difficulty?

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    CodeChef_admin, I would still like to know if problems are sorted by difficulty at the very beginning. And is it same for Longs and Lunchtimes too?

    • »
      »
      »
      4 года назад, # ^ |
        Проголосовать: нравится +6 Проголосовать: не нравится

      At CodeChef, problems are not supposed to be in sorted order. But in this contest, the problems were in sorted order because I like it in this way (Yes, INVERACTIVE was supposed to be easier than XOXO).

      I didn't see your comment before the round, so couldn't reply to your comment :'(

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

The video editorials to the problems are uploaded on Youtube

»
4 года назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

How to solve C? Great contest though :)

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    First, root the tree arbitrarily and calculate for each node its depth. Then, for each node, if its depth is even put a 1 on it. Else, put a 2. I dont have a rigurous proof of why this works, but it's easy to convince yourself once you see it.

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится +1 Проголосовать: не нравится

    Just Color the Nodes with 1 if their parent is 2 other wise 1

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится +4 Проголосовать: не нравится

    $$$1-2$$$ coloring should work.

»
4 года назад, # |
Rev. 2   Проголосовать: нравится +8 Проголосовать: не нравится

Thank you for participating! What is your favourite problem from the contest?

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится -18 Проголосовать: не нравится

    Sir , Editorial published ? or how to solve D ?

  • »
    »
    4 года назад, # ^ |
    Rev. 2   Проголосовать: нравится +8 Проголосовать: не нравится

    I liked An Inveractive Problem the most. Though couldn't solve it even after a lot of submissions.

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    I particularly enjoyed solving PATHSUMS, though I didn't fully solve it (mistake in implementation), but all three problems I managed to come up with ideas for seemed very well balanced and interesting. Great round overall, at least for me.

»
4 года назад, # |
Rev. 2   Проголосовать: нравится +35 Проголосовать: не нравится

Screencast with commentary, 2nd place: https://youtu.be/bDoHVOZlqCE

Every problem was nice separately (I especially liked PATHSUMS, INVERACT, MORPH) but there was too much constructive stuff. Div1 was: construct tree, construct sequence, construct sequence, discover sequence, transform sequence, unsolvable problem. The third of these (XOXO) quickly becomes dp problem but everything else was constructive/adhoc, that's just too much.

I understand now why antontrygubO_o enjoyed your previous cook-off :D

»
4 года назад, # |
  Проголосовать: нравится +6 Проголосовать: не нравится

How is the checker implemented for DIANE?

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится +12 Проголосовать: не нравится
    Checker
    • »
      »
      »
      4 года назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Thanks.

    • »
      »
      »
      4 года назад, # ^ |
        Проголосовать: нравится +8 Проголосовать: не нравится

      Can you describe the part of not calculating all gcds and minimum for every subarray naively and getting the accurate answer code seems wonderful but I just need to know the trick used here as it seems a wonderful thing to learn.

      • »
        »
        »
        »
        4 года назад, # ^ |
        Rev. 3   Проголосовать: нравится +3 Проголосовать: не нравится
        Sum of all subarray minimums:
        Sum of all subarray gcds:
»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Did not receive laddus yet :(