제출 #1065681

#제출 시각아이디문제언어결과실행 시간메모리
1065681alex_2008Robot Contest (IOI23_robot)C++17
15 / 100
123 ms5684 KiB
#include "robot.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
//H,   W, S, E, N, T
//Cur, L, D, R, U, Finish
//void set_instruction(vector<int> S, int Z, char A) {
//
//}

void program_pulibot() {
	//(0, -2, 0, 0, -2) -> (1, 1)
	for (int u : {0, 1}) {
		for (int i : { -2, -1, 0, 1, 2 }) {
			for (int j : { -2, -1, 0, 1, 2 }) {
				for (int k : { -2, -1, 0, 1, 2 }) {
					for (int z : { -2, -1, 0, 1, 2 }) {
						if (j == -2 && k == -2) set_instruction({ u, i, j, k, z }, 1, 'T');
						else {
							if (i == 0) set_instruction({ u, i, j, k, z }, 1, 'W');
							else if (j == 0) set_instruction({ u, i, j, k, z }, 1, 'S');
							else if (k == 0) set_instruction({ u, i, j, k, z }, 1, 'E');
							else if (z == 0) set_instruction({ u, i, j, k, z }, 1, 'N');
							else {
								if (i == 1) set_instruction({ u, i, j, k, z }, 2, 'W');
								else if (j == 1) set_instruction({ u, i, j, k, z }, 2, 'S');
								else if (k == 1) set_instruction({ u, i, j, k, z }, 2, 'E');
								else if (z == 1) set_instruction({ u, i, j, k, z }, 2, 'N');
							}
						}
					}
				}
			}
		}
	}
}

//int main() {
//	
//}
#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...