| Title |
User |
Message |
Date Posted |
| Re: 2\n2\n not accepted but 3\n3\n is? |
Alex |
The alternate output file was mysteriously missing. I remade it, so Hanson's comment is now valid again and WA submissions have been rejudged. Note to Brian: Consider displaying an error when alterna... |
Aug 18, 2014 - 7:05:50 am UTC |
| Re: 2\n2\n not accepted but 3\n3\n is? |
sigkill |
Noticed the same effect - extremely weird, considering that my "right biased" code matches the data from http://mmhs.ca/ccc/index.htm perfectly. |
Aug 18, 2014 - 6:16:12 am UTC |
| Re: 2\n2\n not accepted but 3\n3\n is? |
xiaowuc1 |
It could be the case that the verifier isn't working, contrary to Hanson's post from 6 years ago, and your output ends up needing to match the judge output exactly. |
Jun 29, 2014 - 6:25:50 am UTC |
| 2\n2\n not accepted but 3\n3\n is? |
SharkRetriever |
Hi, I have finally managed to get an OK, which involved changing all double-rights to double-lefts. i.e. 2 2 1 600 turns into 3 3 1 600 Is there any reason why the first version is not considered ju... |
Jun 28, 2014 - 10:40:56 pm UTC |
| Re: Some test cases ? |
jargon |
Yes; your program should optimise the number of actions, and turning left three times is less optimal than turning right once. |
Oct 02, 2011 - 4:52:06 pm UTC |
| Some test cases ? |
fail |
My program turns only left and does the right turn with equivalent number of left moves . Does it matter ? |
Oct 02, 2011 - 2:23:36 pm UTC |
| Re: What if |
hansonw1 |
The judge will accept any shortest route. |
Dec 05, 2008 - 1:51:04 am UTC |
| What if |
StealthAdept |
Suppose that after all moves in the input are done, the lander is at (0,0), and the rover is at (0,10), facing up (facing the opposite direction of the lander). Should the rover turn left twice then m... |
Dec 05, 2008 - 1:46:58 am UTC |
