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

Автор wittyskull, 7 лет назад, По-английски

Hello everyone,

Computer Club, MNNIT Allahabad is 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 problemset promises to be interesting for everyone. The characters in the problem statements are based on Breaking Bad.

Details:

Contest Date : 3rd September 2017

Time : 2200 to 0100 IST

Programming Partner : Codechef

Register your teams here->Contest Link

For online round, top two global 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: advitiyabrijesh, facelessman, abhi_1595, tttayushag10004, pparwal12, wittyskull, garuna and abhi1agarwal.

Last year's problemset : Insomnia-2016

Follow our facebook page for further information.

UPD 1: Languages allowed are C,C++,Java and Python (ACM ICPC Styled). Less than 3 days to go.

UPD 2: Contest is postponed by 3 hours as it was clashing with a hackerearth contest. Now it starts on 3rd September 2200 IST.

UPD 3: Contest starts in less than 10 hours.

UPD 4: The contest has ended. Congratulations to the winners.

  1. Team nipteamINVWVZ, SaSa, ITDOI.

  2. Team mutabilityuwi .

  3. Team iitishubhamgoyal__, vntshh.

The ranklist is here. Editorials will be shared in some time. Hope that everyone found the problemset interesting.

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

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

Searching for a teammate(s) for this contest, if you want to be team with me please write PM.

Little requirement: Codeforces 1650+ rating.

UPD: In our team we are 2 people: me and haleyk100198.

UPD2: CSAcademy made training contest for EJOI, so I can't participate Insomnia :(

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

Searching for a teammate(s) for this contest, if you want to be team with me please write PM.

Little requirement: Codeforces 1200- rating.

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

If anyone finds me fit for their team, PM me.

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

which languages are allowed ?

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

Hackerearth's Indiahacks online Final round is on 3rd Sept, 6-9 pm(IST). Would you mind shifting your contest hours by at least 2 hours? thanks.

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

Bump! Contest starts in under half an hour! Happy Coding!

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

Solution for the last one?

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

Approach to Tuco meets Heisenberg?

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

Approach to solve Total Meth ?

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

    I solved it by constructing a recurrence for the sum . First lets solve the problem when N is a power of 2 minus 1. You can solve it for any value of N once you solve for powers of 2 minus 1.

    bi denotes the number of 1's in binary representation of i.

    If you notice the binary representation of numbers from to N - 1 , it is same as the numbers from 0 to with an extra 1 added to the front . We can exploit this fact to create the sum.

    Let

    S(N) = S(N' - 1) + [((N' + 0) * (b0 + 1)) + ((N' + 1) * (b1 + 1)) ... ((N' + N') * (bN' + 1))]

    T(N) = 2 * T(N') + N'

    Hence you can compute the value of S(N), T(N) in O(log(N)) .

    For solving for any value of N you need to split it into smaller powers of 2 and combine the results . Our AC CODE

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

Any expected time for when editorials will be published?

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

how to solve walter and skyler?

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

My team (Team TooLazyToPropagate, winners of onsite round) has not received the prize yet (and it has been 5-6 months already). Please look into the matter and resolve.

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

My team (runner ups) also hasn't received anything and it has been over 5 months.