Mamalesh's blog

By Mamalesh, history, 6 weeks ago, In English

We invite you to participate in CodeChef’s Starters124, this Wednesday, 6th March, rated for till 5-Stars(ie. for users with rating < 2200).This contest is organized by Udyam’24, IIT BHU.

Time: 8:00 PM — 10:00 PM IST

Joining us on the problem setting panel are:

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

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. Hope to see you participating.

Udyam'24 is the technical fest of the Electronics Engineering Society of IIT BHU, and this contest is conducted under its Competitive Programming and Web Development event, Devbits!!

So what are you waiting for? fill the form, register for the event.

Should you have any queries about the event, feel free to reach out to me Mamalesh or ryokou.

Hope to see you participating.

Good Luck!

UPD : You can find the editorial here

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

»
6 weeks ago, # |
  Vote: I like it -17 Vote: I do not like it

please don't keep the duration of contests more than 135 minutes

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
6 weeks ago, # |
Rev. 2   Vote: I like it +30 Vote: I do not like it

Me waiting for "Starters (Rated for All)" after becoming a 7* coder:

mr-bean-waiting-meme
»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Amazing round

  • »
    »
    6 weeks ago, # ^ |
    Rev. 2   Vote: I like it +14 Vote: I do not like it

    yeah the problems were good, specifically i liked the 4th problem

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

    speedforces

    • »
      »
      »
      6 weeks ago, # ^ |
        Vote: I like it +9 Vote: I do not like it

      every codechef round is speedforces because at the end almost all users solve the same number of problems except some dumb people who don't cheat and keep trying.

»
6 weeks ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

Reminder!!

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can we solve "It is a tree?" by using segment tree? I got till the point that the queries needed count of elements who occur only once in $$$(tin_u + 1, tout_u)$$$, but with updates happening I don't really know how to solve further.

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

    You can solve for $$$100$$$ pts with MO-updates in $$$O(N + Q * (N^{2/3} + logQ))$$$

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

omg, 42000 participants. It's even more than cf

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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