제출 #1244934

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

robot

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

void program_pulibot()
{
    for (int i = -2; i <= 2; i++)
    {
        for (int j = -2; j <= 2; j++)
        {
            for (int h = -2; h <= 2; h++)
            {
                for (int h1 = -2; h1 <= 2; h1++)
                {
                    if(j == -2 && h == -2)
                    set_instruction({0, i, j, h, h1}, 1, 'T');
                    else if(h == 0)
                    {
                        set_instruction({0, i, j, h, h1}, 1, 'E');
                        set_instruction({1, i, j, h, h1}, 1, 'E');
                    }
                    else if(j == 0)
                    {
                        set_instruction({0, i, j, h, h1}, 1, 'S');
                        set_instruction({1, i, j, h, h1}, 1, 'S');
                    }
                    else
                    {
                        if(h1 == 1)
                        {
                            set_instruction({0, i, j, h, h1}, 2, 'N');
                            set_instruction({1, i, j, h, h1}, 2, 'N');
                        }
                        else if(i == 1)
                        {
                            set_instruction({0, i, j, h, h1}, 2, 'W');
                            set_instruction({1, i, j, h, h1}, 2, 'W');
                        } 
                        else if(h == 1)
                        {
                            set_instruction({0, i, j, h, h1}, 2, 'E');
                            set_instruction({1, i, j, h, h1}, 2, 'E');
                        }
                        else if(j == 1)
                        {
                            set_instruction({0, i, j, h, h1}, 2, 'S');
                            set_instruction({1, i, j, h, h1}, 2, 'S');
                        }
                    }
                }
            }
        }
    }
}

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