ByteRace 2k19!! Results and Editorials

Revision en1, by Nightmare05, 2019-11-16 16:47:54

Hi guys,

I would like to thank all participants for making this event a grand success and specially thank ck98, darklight13, LightYear, kunj017, scameeer, leviOosa and hackcyborg for the problem setting and testing efforts and specially for actively managing the queries during contest!!

So, without wasting more time I'd like to congratulate our winners:

  1. nuip

  2. Amoo_Safar

  3. Prashant Shishodia

  4. kimden

  5. scopeInfinity

Based on the leaderboards following people have qualified for prizes:

Overall top 3:

  1. nuip

  2. Amoo_Safar

  3. Prashant Shishodia

Top 5 Indians:

  1. Prashant Shishodia

  2. scopeInfinity

  3. cerberus97

  4. _shanky

  5. hitman623

Top 2 from IIT Patna(presently studying):

  1. intruder_p

  2. DeepThought42

Editorals!

Is It Some Space Cakewalk?

The main idea for problem was pigeon-hole principle i.e in worst case we pick all the different type of cakes first and then any additional cake would make a pair repeat. So the answer to the problem was number of different types of cake in the list + 1.

Time Complexity O(n+max(T)).

Author Solution

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English Nightmare05 2019-11-16 22:53:41 3 Tiny change: 'ions will the answe' -> 'ions will be the answe'
en6 English Nightmare05 2019-11-16 22:38:32 0 (published)
en5 English Nightmare05 2019-11-16 22:35:51 78 (saved to drafts)
en4 English Nightmare05 2019-11-16 22:31:06 3265 Tiny change: '18df/)\n\n#### **Problem ' -> '18df/)\n\n**Problem ' (published)
en3 English Nightmare05 2019-11-16 17:05:25 3413
en2 English Nightmare05 2019-11-16 16:53:39 56 Tiny change: 'x(T)).\n\n`Author Solution`\n\n[`Auth' -> 'x(T)).\n\n[`Auth'
en1 English Nightmare05 2019-11-16 16:47:54 1700 Initial revision (saved to drafts)