yash_daga's blog

By yash_daga, 5 months ago, In English

We invite you to participate in CodeChef’s Starters146, this Wednesday, 7th August, rated upto 5 stars (i.e. for users with rating < 2200)

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

Joining us on the problem-setting panel are:

Note: Some problems have subtasks

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.

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

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

.

»
5 months ago, # |
Rev. 2   Vote: I like it -15 Vote: I do not like it

I am not fond of the second subtask of BINSTRAGAIN. It appears that a constant factor was quite tight in this problem. The fastest AC is nearly half the time limit and most ACs are even slower. Please think twice before setting such tight constraints again.

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

Implementing BACKFRONT is literally not fun, I gave up not because it's hard just so many conditions I mean at least reduce the length of the subsequences to make it bearable but nice contest overall

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

I don't see the editorial?

Also for the "Connect the Chains", I came up with a solution where we only connect the middle 2 nodes of 1 chain with either of the middle 2 of next. This way I can solve it using dp. Why is this solution wrong?