The ranklist is completely blank right now.

Can someone pls help with missing case for J.

Following was our approach:

• If k=0 and m=n-1 then make a tree.

• If k=0 and m=n then make a tree with a cycle of size 3

• If k=n and m>=n make a cycle using all vertices and keep on adding edges until m completed

• If n>k>=4, then keep on making triangles (cycle of size 3) connected at 1 common vertex until m>n. Once m=n then while k>0 add and connect vertices to a corner vertex of the triangles. And once k=0 then connect vertices to common vertex of the triangles.

• Else output -1

What's the point of having $$$n = 5e5$$$ with a TL of 4 seconds in A? As far as I know, there aren't any trivial $$$O(n \log^2{n})$$$ or $$$O(n^{3/2})$$$ solutions. I somehow managed to rack up 10 penalties (and simultaneously ruin my team's entire performance) fixing the constant-factor TLE of my $$$O(n \log{n})$$$ solution (FUCK TEST CASE 45).

The link shows your are not allowed to view the contest . Is there any glitch which will be resolved before the contest or any problem with my account?

Editorial

Where can we submit our solutions? The replay contest doesn't seem to be accepting submissions.

my approach for problem H. RobinHood

I store all the unique elements of the array inside a temporary array (let's call it temp) and start traversing it. Let's say I am currently at an element with value $$$x$$$ and frequency $$$F[x]$$$, where $$$F$$$ is data structure used to store the frequency of elements (I used a map). The logic is as follows

• If I delete none of the occurrences of $$$x$$$, I get $$$F[x]$$$ occurrences to keep.
• If I decide to delete one occurrence of $$$x$$$, then I get $$$F[x]$$$ + $$$F[x-1]$$$ — $$$1$$$ elements to keep.
• similarly if I decided to delete two occurrence of $$$x$$$ then I get $$$F[x]$$$ + $$$F[x-1]$$$ + $$$F[x-2]$$$-$$$2$$$ to keep.
• I perform this process $$$min(freq, x)$$$ times, taking the maximum among all results.

and i do this for every unique x and at last i take the maximum stored among all the x's and output

size of array — maximum i could get

what is wrong in this? any test case where this fails ? our team got hard stuck on this, thanks in advance.

Is PDF version of the problemset available?

In codechef, the problems are sorted. I want to checkout problemset without it being sorted :)