| Title |
User |
Message |
Date Posted |
| Re: Re: Something wrong with judge(and my program) ? |
bbi5291 |
Pretty much, yeah. It's generally pretty hard to find problems with solutions slower than O(n) but faster than O(n log something). Unless they involve disjoint sets. Or are extremely interesting, like... |
Nov 19, 2011 - 7:54:22 am UTC |
| Re: Re: Something wrong with judge(and my program) ? |
fail |
My exams are still not over, but I can't get this question out of my head, can I ask for a more elaborate hint ? Do you mean there is a O(n) solution ? |
Nov 19, 2011 - 7:37:11 am UTC |
| Re: Re: Something wrong with judge(and my program) ? |
bbi5291 |
I wouldn't recommend it. There is a solution with asymptotically better running time. |
Oct 26, 2011 - 7:50:32 pm UTC |
| Re: Something wrong with judge(and my program) ? |
fail |
Like, you mean I must write my own Priority Queue. |
Oct 26, 2011 - 6:06:43 pm UTC |
| Re: Re: Something wrong with judge(and my program) ? |
bbi5291 |
If you're using the "expected" priority queue solution, it should be O(n log d), which I would expect to be too slow for the last test case. |
Oct 26, 2011 - 5:12:41 pm UTC |
| Re: Something wrong with judge(and my program) ? |
fail |
Sorry guys for the delayed response(I had exams). Thanks for the corrections, bbi5291. But could someone please tell me whether my implementation in O(nlogd) ?( or is it O(n^2) in worst case ? ). Or a... |
Oct 26, 2011 - 4:54:51 pm UTC |
| Re: Something wrong with judge(and my program) ? |
bbi5291 |
It appears that this is due to some undocumented bug in either the hypervisor, or the kernel, or both, and doesn't occur for C and C++ programs because those will always only use one core at a time un... |
Oct 17, 2011 - 7:00:08 pm UTC |
| Re: Something wrong with judge(and my program) ? |
SourSpinach |
Haha, don't worry about it - the Judge is having a weird issue with sometimes reporting the wrong runtime. It doesn't affect your result, and will be fixed soon. |
Oct 17, 2011 - 6:52:53 am UTC |
| Something wrong with judge(and my program) ? |
fail |
I think I have a O(nlogd) solution. But sometimes it responds with something like : Test case #1: OK [0.080s, 2.6M] (10/10) Test case #2: OK [0.130s, 2.6M] (10/10) Test case #3: OK [4.460s, 2.6M] (10... |
Oct 16, 2011 - 5:58:44 pm UTC |
