제출 #1132745

#제출 시각아이디문제언어결과실행 시간메모리
1132745SpyrosAlivRobot Contest (IOI23_robot)C++20
16 / 100
65 ms5608 KiB
#include <bits/stdc++.h> #include "robot.h" void program_pulibot() { for (int l = -2; l <= 1; l++) { // right is available for (int b = -2; b <= 1; b++) { for (int a = -2; a <= 1; a++) { set_instruction({0, l, b, 0, a}, 1, 'E'); } } } for (int r = -2; r <= -1; r++) { // right is unavailable, but bottom is available for (int l = -2; l <= 1; l++) { for (int a = -2; a <= 1; a++) { set_instruction({0, l, 0, r, a}, 1, 'S'); } } } for (int r = -2; r <= -1; r++) { for (int b = -2; b <= -1; b++) { // both below and right are unavailable if (b == -2 && r == -2) continue; // maybe its the end? for (int l = -2; l <= 1; l++) { // move above set_instruction({0, l, b, r, 0}, 1, 'N'); } } } for (int a = -2; a <= 1; a++) { for (int l = -2; l <= 1; l++) { set_instruction({0, l, -2, -2, a}, 1, 'T'); } } /* // only left is available for (int r = -2; r <= -1; r++) { for (int b = -2; b <= -1; b++) { for (int a = -2; a ) } }*/ }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...