InfernoSloth's blog

By InfernoSloth, 2 months ago, In English

Hello Codeforces!

As a part of IISc Bangalore's annual science fest Pravega, we will be hosting HonorCode, a CP contest on 30 July 2021.

Contest Details

Prizes

  • Prices worth Rs 15k to be won!
  • Fill this form to be eligible for prizes

Note: Anyone can participate but only Indian students UG or below are eligible for prizes.

Joining me on the panel are:

I would like to thank all of them for the round preparation. Along with them I would also like to thank

  • Balajiganapathi for allowing us to host our contest on amazing CodeDrills platform.
  • deepa_panwar for developing amazing CodeDrills platform.

Good Luck & Have Fun!

Hope to see you participating!!

UPD1: Congratulations to all the winners and participants. Sorry for the skewed difficulty distribution. Editorials will be released soon. For now, you can look at the setter's code and some hints.

UPD2: Editorial is out

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

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

Reminder: The contest starts in 30 mins

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

All problems are same -_-

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

No statements

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

Problem Statement is missing.

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

Sorry there was an issue with the problem statement. It should be fixed now.

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

How to solve problem C Eat Candy?

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

For the problem Max Wins, is this approach right? Create a sorted array and for every element in original array, find the upper bound(say x). Answer would be (x-1)/2 for this element and time complexity O(NlogN)

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

Can we solve problem A with the help of stack?

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

How to Solve Problem D. Here is problem's link: Even Tree