Submission #1082278

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082278		mickey080929	Robot Contest (IOI23_robot)	C++17	24 / 100	137 ms	7400 KiB

robot

#include "robot.h"
#include <bits/stdc++.h>

using namespace std;

char dir[] = {' ', 'W', 'S', 'E', 'N'};

void set_instruction(std::vector<int> S, int Z, char A);

pair<int,char> cal(vector<int> S) {
    if (S[1] == 1 || S[2] == 1 || S[3] == 1 || S[4] == 1) {
        for (int i=1; i<=4; i++) {
            if (S[i] >= 7 && S[i] - 6 == i) {
                return {6, dir[i]};
            }
        }
        for (int i=1; i<=4; i++) {
            if (2 <= S[i] && S[i] <= 5) {
                return {1, dir[i]};
            }
        }
        return {1, 'T'};
    }
    if (S[0] == 6) {
        for (int i=1; i<=4; i++) {
            if (S[i] >= 7 && S[i] - 6 == i) {
                return {6, dir[i]};
            }
        }
        for (int i=1; i<=4; i++) {
            int oth = (i - 1 + 2) % 4 + 1;
            if (2 <= S[i] && S[i] <= 5 && S[i] == oth+1) {
                return {oth + 6, dir[i]};
            }
        }
        return {1, 'T'};
    }
    if (S[0] >= 7) {
        for (int i=1; i<=4; i++) {
            if (S[i] == 6) {
                return {0, dir[i]};
            }
        }
        return {1, 'T'};
    }
    if (S[2] == -2 && S[3] == -2) {
        for (int i=1; i<=4; i++) {
            if (2 <= S[i] && S[i] <= 5) {
                return {1, dir[i]};
            }
        }
    }
    for (int i=1; i<=4; i++) {
        if (S[i] == 0) {
            return {i+1, dir[i]};
        }
    }
    return {6, 'H'};
}

void program_pulibot()
{
    int MX = 10;
    for (int a=-2; a<=MX; a++) {
        for (int b=-2; b<=MX; b++) {
            for (int c=-2; c<=MX; c++) {
                for (int d=-2; d<=MX; d++) {
                    for (int e=-2; e<=MX; e++) {
                        auto ret = cal({a, b, c, d, e});
                        set_instruction({a, b, c, d, e}, ret.first, ret.second);
                    }
                }
            }
        }
    }
}

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