#include "robot.h"
#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;
void program_pulibot(){
vi aux={0, -2, 0, 0, -2};
set_instruction(aux, 1, 'E');
aux={0, 1, 0, 0, -2};
set_instruction(aux, 1, 'E');
aux={0, 1, 0, -2, -2};
set_instruction(aux, 1, 'S');
aux={0, 0, 0, -2, 1};
set_instruction(aux, 1, 'S');
aux={0, 0, -2, -2, 1};
set_instruction(aux, 1, 'T');
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
86 ms |
5460 KB |
Unexpected state: [0, -2, -1, 0, -2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
99 ms |
5456 KB |
Output is correct |
2 |
Correct |
83 ms |
5448 KB |
Output is correct |
3 |
Correct |
84 ms |
5620 KB |
Output is correct |
4 |
Correct |
84 ms |
5456 KB |
Output is correct |
5 |
Correct |
93 ms |
5792 KB |
Output is correct |
6 |
Correct |
84 ms |
5644 KB |
Output is correct |
7 |
Correct |
84 ms |
5456 KB |
Output is correct |
8 |
Correct |
84 ms |
5460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
99 ms |
5456 KB |
Output is correct |
2 |
Correct |
83 ms |
5448 KB |
Output is correct |
3 |
Correct |
84 ms |
5620 KB |
Output is correct |
4 |
Correct |
84 ms |
5456 KB |
Output is correct |
5 |
Correct |
93 ms |
5792 KB |
Output is correct |
6 |
Incorrect |
91 ms |
5556 KB |
Unexpected state: [0, -2, 0, -1, -2] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
88 ms |
5456 KB |
Unexpected state: [0, 1, -1, 0, -2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
99 ms |
5456 KB |
Output is correct |
2 |
Correct |
83 ms |
5448 KB |
Output is correct |
3 |
Correct |
84 ms |
5620 KB |
Output is correct |
4 |
Correct |
84 ms |
5456 KB |
Output is correct |
5 |
Correct |
93 ms |
5792 KB |
Output is correct |
6 |
Correct |
84 ms |
5644 KB |
Output is correct |
7 |
Correct |
84 ms |
5456 KB |
Output is correct |
8 |
Correct |
84 ms |
5460 KB |
Output is correct |
9 |
Incorrect |
85 ms |
5588 KB |
Unexpected state: [0, -2, -1, 0, -2] |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
84 ms |
5460 KB |
Unexpected state: [0, -2, -1, 0, -2] |
2 |
Halted |
0 ms |
0 KB |
- |