chinmay0906's blog

Invitation for Insomnia Qualifier 2018
By chinmay0906, history, 6 years ago, In English

Hello everyone,

We are an educational student club at Motilal Nehru National Institute Of Technology, Allahabad, an Institute of National Importance in India. Our Computer Coding Club as we call it, is a official student organization under Student Activity Center (SAC) of our college. We are glad to invite you to the annual programming competition of MNNIT Allahabad, India, which is an ACM-ICPC style team programming contest of 3 hours duration held on CodeChef during its annual technical fest Avishkar. The team can consist up to 3 members. The problem set promises to be interesting for everyone. The characters in the problem statements are based on Sacred Games.

Details:

Contest Date & Time: 1st September 2018 22:00 IST to 2nd September 2018 01:30 IST

Programming Partner : Codechef

Register your teams here->Contest Link

Languages allowed are C,C++,Java and Python.

For online round, top two teams in ranklist and top two MNNIT teams will be getting Codechef goodies.

For onsite round, prizes worth Rs. 31000/- to be won. Top Indian teams from the online round will be called for the onsite round to be held at MNNIT Allahabad.

Problem Setters: chinmay0906, smtcoder, satan_nightmare, ExperienceD, rranjan, gg_14, FLYSKY

Last year's problemset : Insomnia-2017

Follow our facebook event for further information.

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

»
6 years ago, # |
  Vote: I like it +31 Vote: I do not like it

Can you please mention the break-up of the prize among winners? The majority part of total prize was for only MNNIT students last year.

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

    Hello Pranjal,

    Well, first thing we want to clear that the majority part of prize money was given to the team that stood first, which was your team. Actually, the other two teams cumulative prize money was equal to your prize money. Actually last year we weren't able to gather the respective total prize money due to some conflict with our Computer Club and its expenses and we are extremely sorry for that. Thus, last year we distributed a bit of lesser money than what was mentioned. This time, we will try our best that this kind of mistake doesn't happen once again and all the top 3 teams get their actual amount that they actually are supposed to get. Hope, you will understand and participate in Insomnia once again!

    Looking for a healthy participation from everyone :)

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

      Well, I wrote what I was told.

      Irrespective of what happened last year, there is nothing wrong with being more transparent about prizes. You can (should?) still mention the break-up.

      The onsite contest was certainly good and sure, we'll participate again.

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

        As of now, it's not decided yet and it's not even in our hands to be honest. We are just the problem setters of the contest. Our Computer Club decides the breakup, but as they are busy in organizing other Tech Fest events, they haven't decided it till now. Whenever they will decide, I will let you know. Last year, as I mentioned, the percentage of prize money distribution to all the top 3 positions was quite fair. Just like what I mentioned that the 2nd and 3rd positioned team got a cumulative prize money equal to 1st positioned team's prize money. So, yeah this year also it's gonna be fair :)

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

          I am more concerned about the amount you break-up among winners instead of the actual distribution. :)

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

          Has the distribution been decided yet?

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

Will the problem statements be visible only on the devices on which we have logged in with the team account, or can they be viewed on other devices as well ? And how many problems will be there in total ?

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

    Problem Statements will be visible even if you are not logged in.

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

Is it rated??

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

    It is a team contest so it can't be rated!

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

With Just 4 hours to go and over 750 teams already registered, its gonna be thrilling and exciting contest! Gear up for the contest and see you all in the leaderboard! Happy Coding!

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

Delay for 30 mins. :( And I missed my dinner for that.

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

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

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

THRILLED!!!!!!!
1100 team registrations!!!!!
Hope to see one of the best competitions hosted by MNNIT so far...
Gear up guys! may the best team wins...
Happy Coding!!

→ Reply
»
6 years ago, # |
← Rev. 2   Vote: I like it +21 Vote: I do not like it

For SQMANIA, I honestly don't understand how the question is correct. My team got 3 WAs and wasted 1 hour, because for cases like: N=4 10 10 10 10 1 2 3

I have a better solution of 181 instead of 196. I feel that this question should either be removed or rejudged.

Similarly, for SACGAME, our team got 1 WA because we removed cases where the two pawns met in between a turn, because it is not specified that the pawns should not be at the same position after a turn. (Suppose dice throws are:

Player 1: 1 1 2

Player 2: 2 1 1

Then, the two pawns meet at 2, 2 after player 1's second turn. However, the solution and our AC code considers that correct, although it is clearly mentioned that the players play alternatively, and not simultaneously.)

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

    I solved fourth task fast, then go to first and I was unable to get AC for 45 minutes, then solved one more, come back again to first and couldn't find bug... I am waiting to see official solution (maybe I am stupid).

    Tasks which I read were pretty nice!

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

      Yeah, the tasks are nice. My only issue is with A's solution/E's problem statement, otherwise the questions are good. Getting 4 WAs and wasting an hour because of the statement isn't fair.

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

        Also, I checked my code for your example in the first task, and I got 172 :D. You can draw it on next way: go over all sides of squares once and over distances between them twice.

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

          Yes sorry, my bad. But that is the thing, that solution is correct, but their solution (and my later AC code) gives answer = 196.

          → Reply
      • »
        »
        »
        »
        6 years ago, # ^ |
          Vote: I like it -12 Vote: I do not like it

        The problem statements have been updated and the contest has been extended by 30 minutes.

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

          I didn't do this for any prize and this was just one practice for me.

          But this "update" is not fair. We are not talking about missing some "little" piece of text. The point is that 370 teams + judges had wrong solution for initial task, and now change task just to make all solutions correct. So, teams which solved correct problem + spent 1 extra hour in "debuging wrong code" are crazy at the end? They got nothing, and all "smart" people got everything. And you think it is fair?

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

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

→ Reply
»
6 years ago, # |
← Rev. 2   Vote: I like it +12 Vote: I do not like it

In SQMANIA for a very simple test case like n=2 and l1= 100 , l2=100 and g1=2. The answer should be 804. In the accepted solution's logic, the answer is 902.

Accepted Solution logic= ((total_len)-len_n)*5 + (len_n)*4 + total_gap

We got 3 penalties and wasted around 2 hours for solving that. :|

The question should be removed.

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

    Exactly my point. Extending the contest by 30 minutes does not take away the penalties. At the very least, the question should be removed from the contest.

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

    Problem Statement has been updated!

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

      That still doesn't remove all the cases. Cases where d = 0 will still fail.

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

How to solve Apun Hi Bhagwan Hai !

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

    You can check this.

    I am not sure how someone solved it without Google, I run DP in complexity O(n2) and then search on OEIS.

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

    For any partition of the N cubical boxes in k-sets, you can order the boxes in each set of the partition and obtain a valid arrangement. Conversely each valid arrangement provides a partiton of the set of n boxes in k pieces. Thus you want to compute the number of partitions of a set of N elements in k pieces for k = 1,..., N. These is just the Stirling numbers of the second kind. To compute them efficiently you can use this formula and evaluate it with NTT.

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

How to solve Love Triangle?

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

    Consider all the integer points on the three lines. The answer to the problem is "The number of ways to make a triangle from them equals number of ways to select 3 points minus the number of ways the selected 3 points lie on the same line".

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

      Yeah approach was same still didnt get ac.handling big integers was the problem in my code.

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

Will the editorial be posted ?

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

Can anyone explain the approach for the problem sacred game ?

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

Is there any onsite round of Insomnia? If yes than can anyone tell me the details(how many teams will be selected, on which date etc) about onsite round?

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

    Top 15 Indian teams apart from MNNIT teams will be invited for the onsite round! We will soon be sending mails to the selected teams regarding this.

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

Did anybody from the finals got the prize money ?

→ Reply