We invite you to participate in CodeChef’s Starters 43, this Wednesday, 15th June, rated for Div 2, 3 & 4 Coders.
Time: 8 PM — 11:00 PM IST
Joining us on the problem setting panel are: - Setters: Tejas tejas10p Pandey, Utkarsh Utkarsh.25dec Gupta, Lavish lavish315 Gupta, Dung DMCS, Kanhaiya notsoloud1 Mohan, Daanish 7dan Mahajan.
Testers: Utkarsh Utkarsh.25dec Gupta, Nishank IceKnight1093 Suresh
Statement Verifier: Kanhaiya notsoloud1 Mohan
Editorialists: Pratiyush foxy007 Mishra
Contest Admins: Lavish lavish315 Gupta, Tejas tejas10p Pandey
The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.
Also, if you have some original and engaging problem ideas and are interested in them being used in CodeChef's contests, you can share them here.
Hope to see you participating. Good Luck!
Thanks a lot for creating video editorials, but why there are no video editorials for last 2-3 questions of div 2.
Secondly, I love codechef platform(everyone does), but newbie-pupil students like us are not able to see test cases because test cases are hidden which slows the learning process for beginners like us, we are not good at debugging but we will become after descent practice. Can't you public the test cases? Ok If it would take a lot of time to implement then why can't you make a google drive/ Microsoft one drive and upload the folder test cases there like atcoder.
Sorry, but I have one more feature request, please enable atleast one time user name change feature like in atcoder, or do similar like codeforces.
Sorry for requesting a lot of things, but I think other newbies like me would be thinking the same.
Thank you and have a nice day
"but why there are no video editorials for last 2-3 questions of div 2."
There are text editorials for all problems. Video editorials are expensive to make, and we need to reduce our costs to stay afloat. The hardest problems of Div-2 and Div-1 usually have fewer people watching them, and so we took the decision of not creating those video editorials.
"test cases are hidden"
We are in the process of building a feature for this. You can expect to see it in the next couple of months.
"one time user name change feature"
In our architecture, this would need a lot of re-writing of code, and we are not prioritizing this given the amount of effort that it needs. It will be done at some point, but definitely not for the next 1 year at least. Sorry about that.
There is one nice and easy solution to the problem: https://www.codechef.com/START43A/problems/ARRAYSORTING
Read my code first (Code is self explainatory) : https://ideone.com/AKLcq7
There can be at max $$$nC2$$$ inversion $$$<=$$$ $$$n^2$$$, and in each step, we are decreasing the count by at least 1.
No, because I am swapping the consecutive numbers since the condition was $$$k+1$$$ should be placed before $$$k$$$ then we will swap. You can take some examples to understand it better, I will try to explain why it's working:
The elements before $$$k$$$ will not be affected as we are placing $$$k+1$$$ instead of $$$k$$$. If $$$k$$$ is the last element of its increasing subarray, then also placing $$$k+1$$$ will not affect the total count. Now, we are left with just one case, $$$i.e$$$, $$$k$$$ is not the last element in its increasing subarray, so let the element after $$$k$$$ be $$$x$$$.
$$$x>k$$$
$$$k+1$$$ is already to the left of $$$k$$$, so we can say that $$$x>k+1$$$
Therefore, in this case, as well, it won't be increasing the total count of increasing subarrays. You can do similar reasoning for the $$$k+1$$$ element.