They just continue their way without changing direction. Only blocked clones matter.
So, they can occupy the same position… I guess I’ve got to start again
It’s easier than you think, just don’t bother about the other clone, focus on the lead clone and consider it like a wall once it is blocked
Maybe so =)
I had the same problem with the order of the elevators, can you explain how you fixed the order, because I keep getting an “out-of-bounds error”
With which language? Often that means that if you have a tab you try to access tab for example.
My solution doesn’t pass u-turn validation test, but it passes all regular tests. Is that possible?
Yes the same for me…
Leading clone stops juste before the laser wall, but after that, validator says I loose.
I’m scratching my head to find out where is the flaw in my code, but I don’t see why…
You must use an optimised algorithm to do the less step possible, because there are a limited amount of turn you can do.
Have you tried the suggestions explained above?
To me it looks like the test is bugged. Anyone else is having the same issue?
Nope, i relaunched my code, it seems fine, explain your problems in details.
Contrary to the test on the editor, the validation test has the exit point at step 11, being 12 the last place where one can block the leading android. Therefore, when that happens, I lose just because the other androids do not have space to come out. Please let me know if that could be because the validation tests are not the same for everyone or how to solve this issue.
Not sure I understood correctly your issue, but you can do a block on the starting point and following androids will go in the other direction. The same applies if you put a block on a lift exit.
As @CvxFous I launched my code again and got 100% so the validation seems fine.
Thanks for your input @NewboO and @CvxFous. I have been able to get a 100% after fixing my code, due to an issue that only happened on the validation case. I stand my point though that U Turn is different in the editor testing than in validation
I do not understand how is elevatorFloor, elevatorPos read - as far as I can see it defines one variable repeatedly. So in theory, as far as I can see, the initialisation procedure only stores the “last” elevatorFloor, elevatorPos read. If that is not the case, I still do not understand how to access the “other” elevatorPos’es (trying to access something like elevatorPos[i] returns an error, as elevatorPos is an integer, not an array).
I am aware that this is a very basic problem, but I would be very grateful if someone could help out. I’m using Python, if that changes anything - I wasn’t changing the initialisation procedures at all.
@emcid What about store the elevatorPos in your own dictonnary [elevatoorFloor:elevatorPos]
They should specify in the instructions that the elevators are intentionally placed out of order.
It was confusing, as I had assumed that it was in order, and the first four levels did have elevators in order.
Well, it would really be confusing if all test levels had elevators in order. If you make an assumption beyond what is written in the problem statement, your code should at the very least check it…
Hi, i try to solve this in c++, but i always get this error: “'elevatorFloor’ was not declared in this scope”, and the same with ‘elevatorPos’. When i try to replace inicialization before the ‘for’ loop, the value of elevatorFloor is 4197072, so it’s incorectly loaded. Sombody have the same problem?
Hi, I have a problem: i pass all tests except “6 floors, lot of rounds”, when I run that test it seems bugged, all the others tests works great. Someone else has this problem? Could be a bug? I code in Java. Thanks