제출 #844134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
844134		MrBrionix	Robot Contest (IOI23_robot)	C++17	16 / 100	99 ms	5916 KiB

robot

#include<bits/stdc++.h>
using namespace std;

void set_instruction(vector<int> S, int Z, char A);
void program_pulibot()
{
    /*
    set_instruction({0, -2, 0, 0, -2}, 1, 'E');
    set_instruction({0, 1, 0, 0, -2}, 1, 'E');
    set_instruction({0, 1, 0, -2, -2}, 1, 'S');
    set_instruction({0, 0, 0, -2, 1}, 1, 'S');
    set_instruction({0, 0, -2, -2, 1}, 1, 'T');
     */
    /*
    for(int i=-2;i<=1;i++){
        for(int j=-2;j<=1;j++){
            for(int k=-2;k<=1;k++){
                set_instruction({0,i,j,0,k},1,'E');
            }
        }
    }
    
    for(int i=-2;i<=1;i++){
        for(int j=-1;j<=1;j++){
            set_instruction({0,i,j,-1,-2},1,'S');
        }
    }
    
    for(int i=-2;i<=1;i++){
        for(int j=-1;j<=1;j++){
            set_instruction({0,i,j,-2,-2},1,'S');
        }
    }
    
    for(int i=-2;i<=1;i++){
        for(int j=-1;j<=1;j++){
            set_instruction({0,i,-2,-1,j},1,'N');
        }
    }
    
    for(int i=-2;i<=1;i++){
        for(int j=-1;j<=1;j++){
            set_instruction({0,i,-2,-2,j},1,'T');
        }
    }
    */
    
    /*
    set<vector<int>> tmp;
    
    for(int i=-2;i<=2;i++){
        for(int j=-2;j<=2;j++){
            for(int k=-2;k<=2;k++){
                
                tmp.insert({0,i,0,j,k,1,'S'});
                
                if(j!=0 && (j!=-2 || k!=-2))
                tmp.insert({0,i,j,k,0,1,'N'});
                
                if(j!=0 && k!=0)
                tmp.insert({0,i,j,0,k,1,'E'});
                
            
                if(j!=0 && k!=0 && i!=0 && (i!=-2 || j!=-2))
                tmp.insert({0,0,i,j,k,1,'W'});
                
                tmp.insert({1,i,0,j,k,1,'S'});
                 
                
                if(j!=0 && (j!=-2 || k!=-2))
                    tmp.insert({1,i,j,k,0,1,'N'});
                
                if(j!=0 && k!=0)
                    tmp.insert({1,i,j,0,k,1,'E'});
                
                if(j!=0 && k!=0 && i!=0 && (i!=-2 || j!=-2))
                    tmp.insert({1,0,i,j,k,1,'W'});
            }
        }
    }
    
    for(int i=-2;i<=2;i++){
        for(int j=-2;j<=2;j++){
            for(int k=-2;k<=2;k++){
                if(i==0 || i==1)continue;
                if(j==0 || j==1)continue;
                if(k==0 || k==1)continue;
                
                
                
                tmp.insert({0,i,1,j,k,2,'S'});
                
                if(j!=-2 || k!=-2)
                tmp.insert({0,i,j,k,1,2,'N'});
                //else
                //tmp.insert({0,i,j,k,1,1,'T'});
                
                tmp.insert({0,i,j,1,k,2,'E'});
                
                if(i!=-2 || j!=-2)
                tmp.insert({0,1,i,j,k,2,'W'});
                
                
                tmp.insert({1,i,1,j,k,2,'S'});
                
                if(j!=-2 || k!=-2)
                    tmp.insert({1,i,j,k,1,2,'N'});
                //else
                //tmp.insert({0,i,j,k,1,1,'T'});
                
                tmp.insert({1,i,j,1,k,2,'E'});
                
                if(i!=-2 || j!=-2)
                    tmp.insert({1,1,i,j,k,2,'W'});
            }
        }
    }
    
    for(int i=-2;i<=2;i++){
        for(int j=-2;j<=2;j++){
            tmp.insert({0,i,-2,-2,j,1,'T'});
        }
    }
    
    
    
    
    for(auto i : tmp){
        char c = i.back();
        i.pop_back();
        int z = i.back();
        i.pop_back();
        
        set_instruction(i,z,c);
    }
    */
    
    set<vector<int>> tmp;
    
    for(int i=-2;i<=2;i++){
        for(int j=-2;j<=2;j++){
            for(int k=-2;k<=2;k++){
                
                tmp.insert({0,i,0,j,k,1,'S'});
                
                if(j!=0)
                    tmp.insert({0,i,j,0,k,1,'E'});
                
                tmp.insert({1,i,0,j,k,1,'S'});
                
                if(j!=0)
                    tmp.insert({1,i,j,0,k,1,'E'});
            }
        }
    }
    
    for(int i=-2;i<=2;i++){
        for(int j=-2;j<=2;j++){
            for(int k=-2;k<=2;k++){
                if(i==0 || i==1)continue;
                if(j==0 || j==1)continue;
                
                
                if(i!=-2 || j!=-2)
                    tmp.insert({0,k,i,j,1,2,'N'});
                
                if((i!=-2 || j!=-2) && k!=1)
                    tmp.insert({0,1,i,j,k,2,'W'});
                
                
                if(i!=-2 || j!=-2)
                    tmp.insert({1,k,i,j,1,2,'N'});
                
                if((i!=-2 || j!=-2) && k!=1)
                    tmp.insert({1,1,i,j,k,2,'W'});
            }
        }
    }
    
    for(int i=-2;i<=2;i++){
        for(int j=-2;j<=2;j++){
            tmp.insert({0,i,-2,-2,j,1,'T'});
        }
    }
    
    for(auto i : tmp){
        char c = i.back();
        i.pop_back();
        int z = i.back();
        i.pop_back();
        
        set_instruction(i,z,c);
    }
    
}
/*
static const int MAX_COLOR = 19;
static const int MAX_STATE = 5153632; // = (MAX_COLOR + 3) ^ 5
static const int MAX_STEPS = 500000;

static std::ofstream output;

[[noreturn]] static void die(const std::string &message)
{
    std::cout << message << "\n";
    output.close();
    exit(0);
}

[[noreturn]] static void pv(const std::string &message)
{
    die("Protocol Violation: " + message);
}

static int encode_state(const std::vector<int> &S)
{
    int state = 0;
    for (int s : S)
    {
        state = (MAX_COLOR + 3) * state + s + 2;
    }
    return state;
}

struct instruction
{
    char color;
    char action;
};

static int encode_instr(instruction instr)
{
    if (!instr.action)
    {
        return 0;
    }
    int index = std::string("HWSENT").find_first_of(instr.action) + 1;
    return (index << 5) | instr.color;
}

static instruction program[MAX_STATE];

void set_instruction(std::vector<int> S, int Z, char A)
{
    if (S.size() != 5)
    {
        pv("Invalid array");
    }
    for (int s : S)
    {
        if (s < -2 || s > MAX_COLOR)
        {
            pv("Invalid array");
        }
    }
    if (Z < 0 || Z > MAX_COLOR)
    {
        pv("Invalid color");
    }
    if (std::string("HWSENT").find_first_of(A) == std::string::npos)
    {
        pv("Invalid action");
    }
    int code = encode_state(S);
    if (program[code].action)
    {
        pv("Same state array");
    }
    program[code].color = Z;
    program[code].action = A;
}

static std::vector<std::vector<int>> cells;
static int H, W;
static int rx = 1, ry = 1;

static bool step(instruction instr)
{
    cells[rx][ry] = instr.color;
    switch (instr.action)
    {
    case 'H':
        break;
    case 'W':
        ry--;
        break;
    case 'S':
        rx++;
        break;
    case 'E':
        ry++;
        break;
    case 'N':
        rx--;
        break;
    case 'T':
        return true;
    }
    if (cells[rx][ry] < 0)
    {
        die("Invalid move");
    }
    return false;
}

int main()
{
    std::string line;
    std::getline(std::cin, line);
    std::istringstream line_ss(line);
    assert((line_ss >> H >> W) && (line_ss >> std::ws).eof());
    cells.resize(H + 2, std::vector<int>(W + 2));
    for (int j = 0; j <= W + 1; j++)
    {
        cells[0][j] = cells[H + 1][j] = -2;
    }
    for (int i = 1; i <= H; i++)
    {
        cells[i][0] = cells[i][W + 1] = -2;
        std::getline(std::cin, line);
        line_ss.str(line);
        line_ss.clear();
        for (int j = 1; j <= W; j++)
        {
            bool cell;
            line_ss >> cell;
            cells[i][j] = cell ? -1 : 0;
        }
        assert(line_ss && (line_ss >> std::ws).eof());
    }
    program_pulibot();
    output.open("robot.bin", std::ios::binary);
    output.put(H).put(W);
    for (int i = 1; i <= H; i++)
    {
        for (int j = 1; j <= W; j++)
        {
            output.put(cells[i][j]);
        }
    }
    bool done = false;
    int steps = 0;
    while (!done && ++steps <= MAX_STEPS)
    {
        std::vector<int> state = {
            cells[rx][ry],
            cells[rx][ry - 1],
            cells[rx + 1][ry],
            cells[rx][ry + 1],
            cells[rx - 1][ry]};
        instruction instr = program[encode_state(state)];
        output.put(encode_instr(instr));
        
        if (!instr.action)
        {
            die("Unexpected state");
        }
        done = step(instr);
        cout<<rx<<" "<<ry<<"ecco\n";
    }
    if (!done)
    {
        output.put(0xE0);
        die("Too many steps");
    }
    for (int i = 1; i <= H; i++)
    {
        for (int j = 1; j <= W; j++)
        {
            std::cout << std::setw(2) << cells[i][j] << (j == W ? "\n" : " ");
        }
    }
}
*/

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