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:
Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.
In problem [INMAT][1], I get this type of verdict of WA (-1.000000) and WA (0.000000) !! What does WA (-1.000000) mean ?
[1]: CodeChef: Practical coding for everyone
I liked all these problems, and they’re all easy to understand, even MYST is clear when carefully read. Don’t know why so much question in coordinate compression. But I have problem with that idiot prince. 4 days ago I thought I found the solution and got 10 points with quick coding, and good partially correct answers. Improved it a lot with hundreds of custom tests, fixed little bugs since then but after 4 days later I’m still getting the exactly same result. Now I’m stuck and don’t wanna touch to any other problem… I’m gonna kill that prince myself… or let me try to put a big sign saying “Sorry prince but our princess is on another land”
i am stuck on coordinate compression. passed all the given test cases expect last sub task (last test case-9).it’s very painful. i couldn’t find anything wrong in my code. checked so many test cases. but nothing happened. can anyone help me with it. :’( :’(
Great problems. This was the first time I competed in Div 1 and it really was educational. Kudos to the setter and tester for making the problems challenging.
@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