Nice one

Congratulation Bro, Grow more higher

Nice Job man really appreciated

Expecting increase

Finally a coder with Gf Really happy for you TheScrasse

Lets say u have all the numbers odd or even then the answer is the max this u can easily see as odd + odd = even & even + even = even. Now consider the maximum number to be odd lets say the array is 21 11 9 2 then when we consider 21 as the maximum value then when we add 2 to it becomes 22 and 2 becomes one thus no even number left but then even + odd = odd so 11 becomes 10 so it alternates so all the even numbers eventually become 0 and odd numbers become equal to 1. Then if the maximum number is even eventually you will see the number you have to minus is (count of odd-1) if you just use and example.... Sorry Didn't provide with a mathematical proof.

It comes back

Expecting Increase

If we used dp[i][y][0], it would mean we are still in the state where only one hold is selected, which contradicts the fact that we are selecting the second hold at y.

We need to transition to the state where two holds are used, which is captured by dp[i][y][1].

F has a nice explanation

Good Luck Guys...

Tester or Hacker

Firstly we will select 1 17 16 and make the sequence 1 9 10 11 10 15 14, then select 10 15, and make it 12 13 so the final sequence will be 1 9 10 11 12 13 14. so the answer is 2

Yah, its pretty tough I don't have a solution for now but will definitely find a solution..

Good luck guys

Now we know how to get the max score in those games

Can someone help me out for the transition of the dp state in D if we consider negative gate values with k skips of gate.

Nevertheless I guess they will have gotten Wrong answers in further test cases.. Well nice hacks

Nice contest to understand triangles in depth and C was really nice for a XOR question

Expecting increase

Just Use Post Order Traversal from the end point and print the order. IG it works because when you try to the solve from the end point you have limited nodes to work with like 1 distance from end node and then 2... and so on.

Try to think simpler in contest,do as the question says and try to think what effect does the operations or the logic does in the code. If it is to find a answer try binary search, if it is to calculate minimum or maximum try dp, think greedy in A and B

I think It did this month

The array would look like [25, 1, 0,2] . I will stand on the queue for the 3rd then at last For 2nd at before last and for 2nd as you can sss

Let's go We are in the new era

If i can't do the question in 2 to 3 hours usually I take break and move to something else till I get fresh

Should we change the 4000+ name to something else now????

D was a good implementation of use of heaps

Let Her Go

tried using dp to store the results but not working

Can it be tried using the recursion? If we can reduce the TC somehow?

C and D was difficult or I fckd up

Congratulation to all the winners

expecting increase

Congrats , bro really happy for you Achieved what you worked so hard was worth it in the end I guess

dreams are illusion or future

Maybe dreams are just form of illusion or they are the future

tried implementing the same

really thought so

how did u assigned nodes

C was way too tough ig

Expecting increase in rating

I couldn't add my account Please can you help