Thanks to the entire TLE community for taking such wonderful care of us. We truly owe you alot. I have improved in CP so much that you people cannot even imagine. I manifest to reach Expert rating on Codeforces in the next couple of months. Thank you Priyansh. Thank you Ankit for giving such detailed explanations everytime. Thank you TLE
For problem c i saw solution of ecnerwala(rank 3) he had just used the rotate function, he first sorted the arrays and then rotated the first x elements of b and then just calculated beauty. Very easy approach
Thank you so much TLE eliminators for this wonderful video explanation of problem solutions. But I would like to highlight some wrong assumptions made at 08:00 time and that is the thing that all B ends up at the starting( right from first A ) and all A at the ends up at the last ( last B ). But yeah all "i" will be chosen from first A till before last B.
For the Problem C , I sorted array A and sorted array B in non increasing order . Now I make a count that ai>bi and if that count exactly equals x then print accrodingly , if count less than x print NO , or else if count > x then i reversed first (n-x) elements in the updated array B and again checked condition if holds yes or else NO . This is my intutuion can any one say Why am i getting wrong answer.
if a : 1 1 2 b : 1 2 3 and x -> 1 So, here your cnt will be '0' which is less than 'x' your answer : "NO" But actual answer is "YES" when a : 1 1 2 then, b : 2 3 1 or 3 2 1. here x-> is 1
Please fill the feedback form for PCD : forms.gle/MrTJcaD9sivon49h6
Thanks to the entire TLE community for taking such wonderful care of us. We truly owe you alot. I have improved in CP so much that you people cannot even imagine. I manifest to reach Expert rating on Codeforces in the next couple of months. Thank you Priyansh. Thank you Ankit for giving such detailed explanations everytime. Thank you TLE
For problem c i saw solution of ecnerwala(rank 3) he had just used the rotate function, he first sorted the arrays and then rotated the first x elements of b and then just calculated beauty. Very easy approach
Thank You So Much @TLE Eliminator Team for the great Contest Discussion, Thanks Ankit Ghildiyal and Priyansh.
Problem D explanation is super good , Thanks , Ankit Ghildiyal
Thank you so much TLE eliminators for this wonderful video explanation of problem solutions. But I would like to highlight some wrong assumptions made at 08:00 time and that is the thing that all B ends up at the starting( right from first A ) and all A at the ends up at the last ( last B ). But yeah all "i" will be chosen from first A till before last B.
Wonderful video. Thank you so much for sharing and explaining so well
Problems of this contest was good
Again, Great Explanation! 💫
upload icpc preliminary round solutions
Just wanted to ask....is there any plan to include centroid decomposition and HLD in level 4??
thanks
Can you tell me the template you use for segment tree
You can check out Priyansh's template if that helps: github.com/Priyansh19077/CP-Templates/blob/master/Range%20Queries/Segment_tree.cpp
For the Problem C , I sorted array A and sorted array B in non increasing order . Now I make a count that ai>bi and if that count exactly equals x then print accrodingly , if count less than x print NO , or else if count > x then i reversed first (n-x) elements in the updated array B and again checked condition if holds yes or else NO . This is my intutuion can any one say Why am i getting wrong answer.
have u got why u are getting wrong ans??
if a : 1 1 2
b : 1 2 3 and x -> 1
So, here your cnt will be '0' which is less than 'x'
your answer : "NO"
But actual answer is "YES"
when a : 1 1 2
then, b : 2 3 1
or 3 2 1. here x-> is 1
you dont actually need segment tree in problem d