Today, I received a message from codeforces that my code for problem B significantly coincides with other people's codes. I neither copied anyone else solution nor shared mine, it was just a coincidence, considering the problem was straightforward to minimize the contribution of 1 in k+1 by clubbing all increments at other indices with the index which requires max increment. This is my code and it was mentioned to match with 268144921, 268151236. Mail said to provide conclusive evidence that it was a coincidence, so who should I contact and how am I supposed to prove it?MikeMirzayanov

This is my solution for problem. In this, why is it exceeding memory limit on test 34?In map f,on cumulative I've 2n numbers stored in it which is <=2e6,so 8*1e6 bytes required to store them.So,overall I'm using space required for initialization of the map(48 bytes for each initialization,so <=48*1e6),filling those maps(<=8*1e6) and initialization of count,count1,count2 and i(<=1e6*32 bytes). So, how is it exceeding 256MB memory limit?Is it temporaries required for recursion taking up such a large remaining space,or am i missing something?