제출 #1259171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1259171		nicolo_010	Robot Contest (IOI23_robot)	C++20	16 / 100	67 ms	5704 KiB

robot

#include <bits/stdc++.h>
#include "robot.h"
using namespace std;
template <typename T>
using v = vector<T>;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i = k; i < n; i++)
#define set_instructions set_instruction
#define cout if(0) cout

map<v<int>, int> mp;
 
bool not_used(v<int> S) {
	bool can = !mp.count(S);
	mp[S] = 1;
	return can;
}

void program_pulibot() {
	v<int> S = {0, 0, -2, -2, 0};
	rep(i, -2, 4) {
		rep(j, -2, 4) {
			S[1] = i;
			S[4] =  j;
			if (not_used(S)) set_instructions(S, 1, 'T');
		}
	}
	S = {0, 0, 0, 0, 0};
	rep(i, -2, 4) {
		rep(j, -2, 4) {
			rep(k, -2, 4) {
				S[1] = i;
				S[2] = j;
				S[4] = k;
				if (not_used(S)) set_instructions(S, 1, 'E');
			}
		}
	}
	S = {0, 0, 0, 0, 0};
	rep(i, -2, 4) {
		rep(j, -2, 4) {
			rep(k, -2, 4) {
				S[1] = i;
				S[3] = j;
				S[4] = k;
				if (not_used(S)) set_instructions(S, 1, 'S');
			}
		}
	}
	S = {0, 0, 0, 0, 0};
	rep(i, -2, 4) {
		rep(j, -2, 4) {
			rep(k, -2, 4) {
				S[1] = i;
				S[2] = j;
				S[3] = k;
				if (not_used(S)) set_instructions(S, 1, 'N');
			}
		}
	}
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 10 / 10
• Subtask 3: 0 / 18
• Subtask 4: 0 / 20
• Subtask 5: 0 / 46