His explanation of problem D does not align with his swiftness of solving problem D and the way he talked through his problem solving - he had difficulties discussing his solution in such a way which would align with the way he coded problem D - he must he a great coder but I feel some unease during all his explanations after submitting his answers but the most unease I felt with problem D where the timeline sometimes skipped 20 to 30 seconds during his explanation (eg he stopped filming and after 20/30 seconds he started filing again - I am an audit expert and I have the unfortunate trait to always check everything - I can be completely wrong though but this is my analysis
can someone explain to me, In problem 3 why he took max of the two cases in problem three instead of doing it separately like for cases when x is greater use 2*x-1 and else 2*y.
That's the same thing as if else condition, if u observe when moves for x is greater than for y then obv 2*x-1 would be greater than 2*y and vice versa for moves of y.
@@nemesis5391 thanks for the comment but I figured it out. The case where this will fail is when we have 7,6,9 . When both x,y are less than k.this approach will fail as it will check for x>y and give ans as 1 but and should be 2. Neals approach will work in these cases.
@@tylerd5924 Here I'm not talking about the value of x or y, here x and y are ceil(x/k) and ceil(y/k) so even when both are less than k, the value will of both will be 1 and else condition i.e. 2*y will take place and answer will be 2. So, u see both are the same things.
There's no roadmap if you're serious about CP imo. I mean you would need basic level about every domain (dp, greedy, graph, ...), but there's no particular roadmap go beyond basic level. Just solve problems
not to be racist, but i feel excessively many indians have infiltrated codeforces and a lot of them were cheating. when was the last time 15000 people had solved upto D in div3. not talking about this contest tho
