| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327722 | SpyrosAliv | Robot Contest (IOI23_robot) | C++20 | 41 ms | 5748 KiB |
#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
set<vector<int>> b4;
void add_instr(vector<int> S, int Z, char A) {
if (b4.find(S) == b4.end()) {
set_instruction(S, Z, A);
b4.insert(S);
}
}
void program_pulibot()
{
for (int i = -2; i <= 1; i++) {
for (int j = -2; j <= 1; j++) {
for (int k = -2; k <= 1; k++) {
add_instr({i, j, -2, -2, k}, 1, 'T');
}
}
}
for (int i = -2; i <= 1; i++) {
for (int j = -2; j <= 1; j++) {
for (int k = -2; k <= 1; k++) {
for (int l = -2; l <= 1; l++) {
add_instr({i, j, k, -2, l}, 1, 'S');
add_instr({i, j, k, -1, l}, 1, 'S');
add_instr({i, j, k, 0, l}, 1, 'E');
}
}
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
