제출 #1041907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041907		Andrey	로봇 대회 (IOI23_robot)	C++17	18 / 100	72 ms	6136 KiB

robot

#include "robot.h"
#include<bits/stdc++.h>
using namespace std;
 
bool check(int a, int x) {
    if(a >= 2 && a <= 5 && (a-x+1002)%4 == 0) {
        return true;
    }
    return false;
}

bool dude(int a) {
    if(a >= 2 && a <= 5) {
        return false;
    }
    return true;
}

void program_pulibot()
{
    char dir[6] = {'z','T','W','S','E','N'};
    for(int c = 0; c <= 6; c++) {
        for(int w = -2; w <= 6; w++) {
            for(int s = -2; s <= 6; s++) {
                for(int e = -2; e <= 6; e++) {
                    for(int n = -2; n <= 6; n++) {
                        if(c == 0) {
                            if(s == -2 && e == -2) {
                                set_instruction({c,w,s,e,n},6,'H');
                                continue;
                            }
                            if(w == -2 && n == -2) {
                                set_instruction({c,w,s,e,n},2,'H');
                            }
                            else if(check(w,2)) {
                                set_instruction({c,w,s,e,n},2,'W');
                            }
                            else if(check(s,3)) {
                                set_instruction({c,w,s,e,n},3,'S');
                            }
                            else if(check(e,4)) {
                                set_instruction({c,w,s,e,n},4,'E');
                            }
                            else if(check(n,5)) {
                                set_instruction({c,w,s,e,n},5,'N');
                            }
                            continue;
                        }
                        if(c == 6) {
                            if(check(w,2)) {
                                set_instruction({c,w,s,e,n},6,'W');
                            }
                            else if(check(s,3)) {
                                set_instruction({c,w,s,e,n},6,'S');
                            }
                            else if(check(e,4)) {
                                set_instruction({c,w,s,e,n},6,'E');
                            }
                            else if(check(n,5)) {
                                set_instruction({c,w,s,e,n},6,'N');
                            }
                            else {
                                if(w == 6) {
                                    set_instruction({c,w,s,e,n},2,'W');
                                }
                                else if(s == 6) {
                                    set_instruction({c,w,s,e,n},3,'S');
                                }
                                else if(e == 6) {
                                    set_instruction({c,w,s,e,n},4,'E');
                                }
                                else if(n == 6) {
                                    set_instruction({c,w,s,e,n},5,'N');
                                }
                                else {
                                    set_instruction({c,w,s,e,n},1,'T');
                                }
                            }
                            continue;
                        }
                        if(w == 6 && c != 2) {
                            set_instruction({c,w,s,e,n},0,dir[c]);
                            continue;
                        }
                        else if(s == 6 && c != 3) {
                            set_instruction({c,w,s,e,n},0,dir[c]);
                            continue;
                        }
                        else if(e == 6 && c != 4) {
                            set_instruction({c,w,s,e,n},0,dir[c]);
                            continue;
                        }
                        else if(n == 6 && c != 5) {
                            set_instruction({c,w,s,e,n},0,dir[c]);
                            continue;
                        }
                        int x = 1;
                        if(w == 6) {
                            x = 2;
                        }
                        if(s == 6) {
                            x = 3;
                        }
                        if(e == 6) {
                            x = 4;
                        }
                        if(n == 6) {
                            x = 5;
                        }
                        if((check(w,2) || check(s,3) || check(e,4) || check(n,5)) && x != 1) {
                            set_instruction({c,w,s,e,n},6,'H');
                            continue;
                        }
                        if(w == 1 || s == 1 || e == 1 || n == 1 || ((n == -2 && w == -2) && x != 1) || (s == -2 && e == -2)) {
                            if(dude(w) && dude(s) && dude(e) && dude(n)) {
                                set_instruction({c,w,s,e,n},1,dir[x]);
                            }
                            else {
                                set_instruction({c,w,s,e,n},x,dir[x]);
                            }
                            continue;
                        }
                        if(x != 1) {
                            set_instruction({c,w,s,e,n},0,dir[x]);
                            continue;
                        }
                        int p = c+1,z;
                        if(p == 6) {
                            p-=4;
                        }
                        if(p == 2) {
                            z = w;
                        }
                        else if(p == 3) {
                            z = s;
                        }
                        else if(p == 4) {
                            z = e;
                        }
                        else if(p == 5) {
                            z = n;
                        }
                        if(z == 0 || check(z,p)) {
                            set_instruction({c,w,s,e,n},p,dir[p]);
                        }
                        else {
                            set_instruction({c,w,s,e,n},p,'H');
                        }
                    }
                }
            }
        }
    }
}

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