#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
void program_pulibot()
{
// WHILE POSSIBLE MOVE EAST
for (int w = -2; w <= 1; w++)
for (int s = -2; s <= 1; s++)
for (int n = -2; n <= 1; n++)
set_instruction({0, w, s, 0, n}, 1, 'E');
// IF UP AND OBSTACLE => MOVE DOWN
for (int w = -2; w <= 1; w++)
for (int e = -2; e <= -1; e++)
set_instruction({0, w, 0, e, -2}, 1, 'S');
// IF DOWN AND OBSTACLE => MOVE UP
for (int w = -2; w <= 1; w++)
set_instruction({0, w, -2, -1, 0}, 1, 'N');
// TERMINATE
for (int w = -2; w <= 1; w++)
for (int n = -2; n <= 1; n++)
set_instruction({0, w, -2, -2, n}, 1, 'T');
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
5440 KB |
Output is correct |
2 |
Incorrect |
84 ms |
5624 KB |
Unexpected state: [0, 0, 0, -2, 1] |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
89 ms |
5732 KB |
Output is correct |
2 |
Correct |
83 ms |
5456 KB |
Output is correct |
3 |
Correct |
84 ms |
5456 KB |
Output is correct |
4 |
Correct |
84 ms |
5456 KB |
Output is correct |
5 |
Correct |
83 ms |
5512 KB |
Output is correct |
6 |
Incorrect |
86 ms |
5496 KB |
Unexpected state: [0, 0, 0, -2, 1] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
89 ms |
5732 KB |
Output is correct |
2 |
Correct |
83 ms |
5456 KB |
Output is correct |
3 |
Correct |
84 ms |
5456 KB |
Output is correct |
4 |
Correct |
84 ms |
5456 KB |
Output is correct |
5 |
Correct |
83 ms |
5512 KB |
Output is correct |
6 |
Correct |
83 ms |
5456 KB |
Output is correct |
7 |
Correct |
85 ms |
5584 KB |
Output is correct |
8 |
Correct |
84 ms |
5712 KB |
Output is correct |
9 |
Correct |
83 ms |
5556 KB |
Output is correct |
10 |
Correct |
85 ms |
5456 KB |
Output is correct |
11 |
Correct |
84 ms |
5424 KB |
Output is correct |
12 |
Correct |
85 ms |
5540 KB |
Output is correct |
13 |
Correct |
86 ms |
5404 KB |
Output is correct |
14 |
Correct |
85 ms |
5572 KB |
Output is correct |
15 |
Correct |
87 ms |
5544 KB |
Output is correct |
16 |
Correct |
83 ms |
5572 KB |
Output is correct |
17 |
Correct |
88 ms |
5544 KB |
Output is correct |
18 |
Correct |
102 ms |
5584 KB |
Output is correct |
19 |
Correct |
84 ms |
5460 KB |
Output is correct |
20 |
Correct |
85 ms |
5484 KB |
Output is correct |
21 |
Correct |
97 ms |
5464 KB |
Output is correct |
22 |
Correct |
86 ms |
5400 KB |
Output is correct |
23 |
Correct |
83 ms |
5456 KB |
Output is correct |
24 |
Correct |
84 ms |
5456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
84 ms |
5716 KB |
Unexpected state: [0, -1, 0, -2, 1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
89 ms |
5732 KB |
Output is correct |
2 |
Correct |
83 ms |
5456 KB |
Output is correct |
3 |
Correct |
84 ms |
5456 KB |
Output is correct |
4 |
Correct |
84 ms |
5456 KB |
Output is correct |
5 |
Correct |
83 ms |
5512 KB |
Output is correct |
6 |
Incorrect |
86 ms |
5496 KB |
Unexpected state: [0, 0, 0, -2, 1] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
83 ms |
5500 KB |
Unexpected state: [0, 1, -1, -1, 0] |
2 |
Halted |
0 ms |
0 KB |
- |