It will be live, got confirmation from codechef.
3 Likes
I will publish a livesolve/editorial on my YT channel after the contest, everyone interested is welcome to come by and watch interesting problems, I hope it will be helpful for you guys.
3 Likes
Will questions contain subtasks?
No, the contest will be ICPC style so binary marks on problem and each problem is of equal points.
REMINDER
1 Like
This was a good Div 1 contest I feel , It had awesome Problem Distribution for Div 1 , atleast The ranklist and no. Of AC’s for the problem says that 
3 Likes
Good questions , really impressed.
Can someone tell me the approach for 3 one , couldn’t get it even after trying for 2 hrs.
Thank you in advance.
1 Like
You can use Difference Array | Range update query in O(1) - GeeksforGeeks
trick and do prefix sum twice instead of once.
Time complexity : O(n)
Segment tree is an overkill
2 Likes
yup , i’ll try to do that,thanks for the hint.
how ? we have to add the AP.
i have used a simple technique of storing indices only in the updating array, feel free to check here
ps-problems were really good(even though i f***ed up a simple one)
2 Likes
Think for a while. Double prefix sum helps here.
1 Like
I just got an AC on 4th problem 2 minutes after the contest, missed it by one insert statement. Problem worst feeling ever 
AC_CODE
WA_CODE
3 Likes
i took forever on B and C and solved D in like 15 minutes
explain your logic / intution
hey @tamo11 @l_returns How do I report plagiarism in this contest. there a few submissions with the same code. These people have used the same code in the December lunch-Time as well.
the submissions are :
solution 1
solution 2
solution 3
solution 4
solution 5
solution 6
Before you change the rating of DIV 2 please run a plag test…
Checked random solution of ques 4 and got this.
Just check the 17 mb solution of 4th question in c++ you may find many more…
Can you please explain how using prefix sums twice helps?