Hello, I just submitted a relatively naive solution to the SCHEDULE problem of MARCH17. It was accepted for 100 points. I think that the test cases for this problem are weak. Could the problem setters please look into it?
1 Like
Don’t post this here dear, post it under the comments section of the concerned problem. The problem setters will themselves answer your query there. (while it might be possible that your post goes ignored here, at discuss forums).
Furthermore, its not allowed to discuss anything regarding contest and problems, not even the fact that your solution worked or what was its time complexity. It might act as hint for some people. Its against the rules of codechef. We have got to be fair.
So please submit your query at the comments of concerned problem, and wait for 1-2 days. The problem setter would personally update you on your query. 
1 Like
Noted. Will do.
1 Like
Thanks for understanding my POV dear. They usually take a day or two to reply, but they definitely address the concern
1 Like
@vijju123 explained everything I think. I’m closing the topic and will open it after the contest. I’ve just answered your comment (under the problem) - it’s hidden for others though FYI.
3 Likes
I was supposed to reopen the topic and I forgot about it, sorry. Opening now.
Indeed, the solution of the author of this topic is O(n^2) but it passed all tests. We are sorry about. New tests were added after the contest. You can try to solve the problem in practice now.
3 Likes
Means its now more difficult? ‘horrified look’
1 Like
Not more difficult to solve the problem correctly. But yeah, more difficult to pass tests ;p
3 Likes
nlogn solution getting time 0.05s makes sense now.
Precisely. Thank you @errichto. I was wondering if my understanding of the upper bound was incorrect.