harryb17's blog

By harryb17, history, 7 weeks ago, In English

Hello support, I was contacted by the system that I was one of the winners of CODETON round 7 and will be rewarded with TON coins. I was asked to provide the wallet details before 28th Jan, which I successfully did. But it's been 3months and ever since then, my TON coins have not been delivered yet. There is no way to communicate the support regarding this issue. Please look into this matter, since I suspect the same thing from CODETON round 8, where I have been placed under 1k rank but probably won't receive the rewards.

Note: I successfully created a wallet before 28th Jan, and provided the right address as asked.

Full text and comments »

  • Vote: I like it
  • +14
  • Vote: I do not like it

By harryb17, history, 9 months ago, In English

In a recent codeforces contest round 892 question E(Maximum Monogonosity) I received a strange MLE on my solution which uses a 3D vector, but the same solution passed when I used a global declared 3D array. I know global declared arrays are faster than vectors and take slightly less size cause of the vector dynamic nature of doubling memory while using push_back. But none of this happened in the following code. can anyone please explain why this happened?

Note: No I didn't use any constant memory of vector for every test case, such that for 1e5 test cases it would fail.

my 3D array was n*k*5, where n & k are <= 3000. the constraints are tight and even while using globally declared array, it was 300Mb out of 512Mb, so that might give a hint why it might fail for vectors, but still, I think there might be a better reason.

Link to my:

Accepted Solution round 892 problem E

Memory Limit Exceeded Solution round 892 problem E

Full text and comments »

  • Vote: I like it
  • +5
  • Vote: I do not like it