coderdhanraj's blog

By coderdhanraj, history, 3 months ago, In English

Hello Codeforces!

Computer Club, MNNIT Allahabad, India is glad to invite you to the annual programming competition of MNNIT, Insomnia, which is an ACM-ICPC style team programming contest of 2.5 hours duration held on Codeforces during its annual technical fest Avishkar. The team can consist of up to 3 members.

Contest Details:

The Top 25 global teams and the Top 25 teams from MNNIT (based on the result of Qualifiers) will qualify for the Finals. The prize distribution for global teams is mentioned below:

Teams consisting of MNNIT students only will be eligible for a separate prize pool.

Register your team for the qualifiers here. [For Non-Mnnitians only]

Also, self-register your team directly on codeforces here

Problem setters: coderdhanraj, sshivendra764, lalit_1471, anonymous_2211, kantan and Sun_Tzu

Testers: 18o3, vrintle, GoatTamer, and Phantom_Deluxe.

We have an exciting problemset awaiting you. Good luck and have fun!

UPD1: Qualifiers is postponed to Saturday, March 16, 22:30 IST.

UPD2: Registrations are started for Qualifiers.

UPD3: Here is the list of invited teams for the Final Round of INSOMNIA 2024. The invite link has been shared to the mail of the team leader submitted in the google form. (Please check your spam as well)

If your team is on the list and still you have not received any mail then please reach out to me on codeforces.

UPD4: Due to unforeseen circumstances, today's contest has been postponed to tomorrow. We apologize for any inconvenience caused. The updated schedule is March 19, 2024, from 10:00 AM to 1:00 PM IST

UPD5: Hope you guys enjoyed both the sets.

Here are the winners of the finals:

Global teams:

  1. Windchime: IceKnight1093
  2. tbd: shiven, GenghizKhan, keyurchd_11

MNNIT Teams:

  1. Blitz: ace01, Vinayak286, Aadersh_Chaubey
  2. MugiWara: aryanguptaaa, arsh.1709, arpit.ras
  3. BahutPeechheRehGaye: lucifer223, NishuOne8, utkarsh1236

One can try problems of finals here

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

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Are non-student teams eligible?

  • »
    »
    3 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Yes, you may write your current company/profession or NA (maybe)

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Qualifiers clashes with CF contest.

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

As this contest is clashing with a Codeforces Round Div1/2, we will be postponing Insomnia Qualifiers to 22:30 IST

»
3 months ago, # |
Rev. 2   Vote: I like it -16 Vote: I do not like it

[Deleted]

»
3 months ago, # |
  Vote: I like it +9 Vote: I do not like it

As an author of this contest, I hope you all will enjoy the problems :)

»
3 months ago, # |
  Vote: I like it +8 Vote: I do not like it

As the author of this contest, I hope that you all will enjoy the problems.

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I am unable to register as no teams are displayed

  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You might not have created any team. So first create a team from Profile > Teams (and invite your teammates) then you can register with team.

»
3 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Sir , Is there any penalty for wrong submissions in this contest ?

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The contest starts within 25 minutes!

  • »
    »
    3 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Sir , is there any penalty for wrong submissions in this contest ?

    • »
      »
      »
      3 months ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      Yes, same as normal gym contests (i.e. 20minutes for each non-AC verdict, even on TC1)

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

Due to the long queue issue, we have shifted the contest by 15 minutes.

»
3 months ago, # |
  Vote: I like it +4 Vote: I do not like it

Sir , are problem sorted in increasing order of difficulty in this contest ?

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I am really tired now because of the recent contest, please postpone it till 11.30pm I am sure many people are tired too

  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This contest is a part of an event in our college's Technical Fest so unfortunately we cannot change the timings.

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

sir ,the submission is in queue from last 5 minutes

»
3 months ago, # |
  Vote: I like it +8 Vote: I do not like it

D's formula looks with really poor properties and scared me at first.

Then I realized that this can be replaced with any random function.....

  • »
    »
    3 months ago, # ^ |
    Rev. 3   Vote: I like it +12 Vote: I do not like it

    And therefor we went randomly on some V-Judge server first Our Messiah and first the strict troubled us but we in the end somehow stress tested and passed it.... P.S. now we know 998 ms >>>> 1000 ms

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

[submission:251812635]

Copied from this page :- https://www.geeksforgeeks.org/diameter-tree-using-dfs/

Team Name -: CJython

Problem :- A

This team has submitted the above mentioned solution by directly copying code from geeks for geeks. I don't know whether this is allowed or not but it will only affect the person who knew the algorithm for finding the diameter of a tree by himself and its implementation. And so I think this should be banned ( submission id is mentioned above ) .

And they are from MNNIT too , and it will affect other teams in contention from MNNIT too..

  • »
    »
    3 months ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    See, it's legal as one can use any code that's published in public before the contest starts, also finding diameter is very trivial. But yeah they should have mentioned the above gfg link with their code but no worries as we got the source from where they used a code which was published before the contest started.

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

is G some kind of digit-dp, calculating how many integers satisfy the property is easy, but how to calculate the individual digit contribution to the total sum?

  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    you can store two values in $$$dp$$$ table $$$\text{(ways, sum)}$$$ and use $$$ways$$$ to calculate the contribution to the current placed digit.

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

any ideas for F

  • »
    »
    3 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Try storing $$$lens$$$ for every existing longest sequence which follows the condition and break/merge them in queries.

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

Hi, my name is included, but I didn't recieve any mail, and I'm not able to message you on cf. Edit: Nvm found it, sorry

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

...please reach out to me on codeforces.

This user has limited set of users that can write him/her.

»
3 months ago, # |
  Vote: I like it +27 Vote: I do not like it

Hello, Computer club MNNIT Allahabad, my team Endurance got selected for the finals, but the postponed time clashes with my Lab exam tomorrow.Also I think that many people would have classes and labs in the morning. So it would be very beneficial if you can plss shift the contest later in the day Or take it at night after the cf contest. Thank you.

  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    We apologize for this but Insomnia is part of our technical fest and today's schedule was clashing with some other important affairs so we had to shift it to tomorrow and cannot be further postponed due to the fest ending tomorrow.

»
3 months ago, # |
  Vote: I like it +13 Vote: I do not like it

If you do last minute change — can you at least shift to the weekend instead so it's convenient for everybody. Our team planned time for today's contest, it's not easy to adapt for the shift considering it's all on a workdays...

»
3 months ago, # |
  Vote: I like it -17 Vote: I do not like it

Due to many requests from the participants, we have postponed the contest by 30 minutes

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

is O_set too slow for I? :')

  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Na my submission got accepted using ordered_set

    • »
      »
      »
      3 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I think i was overkilling with O_set-s, what did you do?

      • »
        »
        »
        »
        3 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I used small to large merging of ordered_multisets to know how many values in my subtree have value strictly smaller than my current node and dfs to know how many ancestors of my current node have value greater than equal to my current node

        • »
          »
          »
          »
          »
          3 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Bruh i did the same thing and it TLE'd lol, thanks tho

          • »
            »
            »
            »
            »
            »
            3 months ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            If you are using the GNU policy-based data structures, then swap(a, b) can behave badly. You may want to use a.swap(b) or b.swap(a) instead.

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

            I got TLE too doing the same thing.

            Edit : it was not the same thing.

»
3 months ago, # |
  Vote: I like it +8 Vote: I do not like it

coderdhanraj An editorial for both the rounds will be helpful.