제출 #956430

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
956430		Dan4Life	로봇 대회 (IOI23_robot)	C++17	26 / 100	95 ms	6172 KiB

robot

#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;


int boundary = -2, obstacle = -1, white = 0, green = 1, blue = 2, red = 3, yellow = 4, orange = 5;
string dir = "WSENHT";
int i, j, k, l, m;

char get_dir(int col, vector<int> subset={1,2,3,4}){
    int pos = 4;
    for(auto u : subset){
        if(u==1 and j==col) pos=0;
        else if(u==2 and k==col) pos=1;
        else if(u==3 and l==col) pos=2;
        else if(u==4 and m==col) pos=3;
    }
    return dir[pos];
}

bool exists_neighbour(int col, vector<int> subset={1,2,3,4}){
    for(auto u : subset){
        if(u==1 and j==col) return true;
        if(u==2 and k==col) return true;
        if(u==3 and l==col) return true;
        if(u==4 and m==col) return true;
    }
    return false;
}

void program_pulibot()
{
    for(i = 0; i <= 5; i++){
        for(j = -2; j <= 5; j++){
            for(k = -2; k <= 5; k++){
                for(l = -2; l <= 5; l++){
                    for(m = -2; m <= 5; m++){
                        if(i==green or exists_neighbour(green) or exists_neighbour(orange)){
                            if(exists_neighbour(red,{2,3})){
                                set_instruction({i,j,k,l,m},orange,get_dir(red,{2,3}));
                            }
                            else if(exists_neighbour(orange)){
                                set_instruction({i,j,k,l,m},white,get_dir(orange));
                            }
                            else if(exists_neighbour(yellow)){
                                set_instruction({i,j,k,l,m},green,get_dir(yellow));
                            }
                            else if(k==boundary and l==boundary){
                                set_instruction({i,j,k,l,m},green,'T');
                            }
                        }
                        else if(k==boundary and l==boundary){
                            set_instruction({i,j,k,l,m},yellow,get_dir(blue));
                        }
                        else if(exists_neighbour(yellow)){
                            
                            if(exists_neighbour(blue)){
                                set_instruction({i,j,k,l,m},yellow,get_dir(blue));
                            }
                            else if(j==boundary and m==boundary){
                                set_instruction({i,j,k,l,m},green,'H');
                            }
                            else{
                                set_instruction({i,j,k,l,m},white,get_dir(yellow));
                            }
                        }
                        else if(exists_neighbour(white,{2,3})){
                            set_instruction({i,j,k,l,m},blue,get_dir(white,{2,3}));
                        }
                        else if(exists_neighbour(blue)){
                            set_instruction({i,j,k,l,m},red,get_dir(blue));
                        }
                    }
                }
            }
        }
    }
}

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