Hello Everybody!↵
↵
For [ "ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)" Problem C](http://codeforces.me/contest/776/problem/C) the given n is 10<sup>5</sup> and the max possible sum is 10 <sup>5</sup> * 10 <sup>9</sup> i.e., 10<sup>14</sup>. For the worst case, my code's complexity is: log(10<sup>14</sup>)*n. And in worst case it will be approximately 50*10<sup>5</sup> . I was expecting that my code will get Accepted easily, coz given time limit is 2.5 sec, but its exceeding time limit on 101 test case which is 100000 2 .↵
↵
Isn't it possible to execute 5*10<sup>6</sup> in 2.5 sec?↵
↵
Why unordered map is taking more time in comparison with map!↵
↵
Thank you very much for reading! ↵
↵
Link to submission:↵
[submission:24944382]↵
↵
For [ "ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)" Problem C](http://codeforces.me/contest/776/problem/C) the given n is 10<sup>5</sup> and the max possible sum is 10 <sup>5</sup> * 10 <sup>9</sup> i.e., 10<sup>14</sup>. For the worst case, my code's complexity is: log(10<sup>14</sup>)*n. And in worst case it will be approximately 50*10<sup>5</sup> . I was expecting that my code will get Accepted easily, coz given time limit is 2.5 sec, but its exceeding time limit on 101 test case which is 100000 2 .↵
↵
Isn't it possible to execute 5*10<sup>6</sup> in 2.5 sec?↵
↵
Why unordered map is taking more time in comparison with map!↵
↵
Thank you very much for reading! ↵
↵
Link to submission:↵
[submission:24944382]↵
