We are thrilled to invite you to participate in the August Long Challenge 2018 sponsored by ShareChat. In addition, there are some exciting internship and full-time job opportunities by ShareChat for Indian programmers in the August Long Challenge 2018. For more details, you may visit the contest page.
I hope you will join your fellow programmers and enjoy the contest problems. Joining me on the problem setting panel are:
I’m assuming there was typo with username of Codechef’s MikeMirzayanov. So, I’m correcting it. If this is not the case then please redo correction. And ban newly linked profile on account of giving false info. xD
@likecs you might have seen my latest solution (the correct one)… And I am damn clear about my time complexity analysis…I even run my code on my PC for worst case…IT DIDN’T OUTPUT ANYTHING EVEN AFTER 10 MINUTES…
@likecs If the intended solution is same as mine then let me tell you that I know that though time complexity seems O(Something) but it is much less than that…But there is a corner test case for which it is really O(Something) and it time outs!!
@pshishod2645 - I think that its best to discuss this in comments section of the problem, or over mail or a private channel with @likecs , as you both can discuss to your hearts content there :). I also dont want anything like “@pshishod2645 discussed things related to contest but wasnt banned but my friend got banned wtf” since I am actively banning people. Hope you understand my dilemma
What I can confirm is, that the problem is solvable
But “time complexity seems O(value was present here but has been edited now)” isn’t allowed either. Afaik disclosing time complexity of soln is also not allowed.
It’s ok but please be careful.
P.S. - For e.g. - Give me expected time complexity for KCOMPRES . I will bring a soln with that complexity. And would hope for AC. My Current O(InsertSomeThingHere) (no I will not tell this to you) gives WA for last test case.