In the last div2 B problem, 283258843 isnt this submission O(nlogn) ?? If it is so then why is it getting TLEd :(. Otherwise what is the correct complexity?

Hi everyone, so there are a few OBVIOUS cheaters in the last div3 who used a solution in problem F, that has a block of code

f=dp2[40][70][70];
  fo(i, 0, n+5){
      fo(j, 0, k+5){
         dp1[i][j]=f;
 }

So chromate00 and a few others went on hacking spree and hacked a LOT of these solutions , but rather than the contest getting skipped for these cheaters entirely, it was just that this problem got hacked and the others still remained as valid submissions.

3 examples: mayank_raj5, pawandev and hello.313 .

Now in the last div1+2, a hell lot of cheaters were SKIPPED and rightfully so but does hacking prevent being skipped?

And also whats a bit fascinating is 2 of these cheaters claim to be from IITs, so it just shows you that college and all is fine , but at the end it will come down to YOUR character and discipline. (A bit of motivation, lol).

And at the end can anyone actually tell me is being hacked the reason that they got saved from being skipped?

Sorry for inconvenience.