Submission #1158753

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158753		The_Samurai	Robot Contest (IOI23_robot)	C++20	16 / 100	68 ms	5612 KiB

robot

#include "robot.h"
#include "bits/stdc++.h"
using namespace std;
pair<int, char> bad = make_pair(-1, 'A');
vector<char> ord = {'W', 'S', 'E', 'N'};
vector<char> iord = {'E', 'N', 'W', 'S'};

pair<int, char> get(int now, int w, int s, int e, int n) {
    if (s == -2 and e == -2) return make_pair(1, 'T');
    vector<int> vec = {w, s, e, n};
    for (int i = 1; i < 3; i++) {
        if (vec[i] == 0) return make_pair(1, ord[i]);
    }
    for (int i = 0; i < 4; i++) {
        if (vec[i] == 1) return make_pair(2, ord[i]);
    }
    return bad;
    // if (count(vec.begin(), vec.end(), 1) > 1) return bad;
    if (count(vec.begin(), vec.end(), 1) == 0) {
        if (w != -2 or n != -2) return bad;
    }
    if (count(vec.begin(), vec.end(), 1) < 2) {
        for (int i = 0; i < vec.size(); i++) {
            if (vec[i] == 0) return make_pair(1, ord[i]);
        }
        for (int i = 0; i < vec.size(); i++) {
            int j = find(ord.begin(), ord.end(), iord[i]) - ord.begin();
            if (vec[j] == 1) return make_pair(2, iord[i]);
        }
    }
    for (int i = 0; i < vec.size(); i++) {
        int j = find(ord.begin(), ord.end(), iord[i]) - ord.begin();
        if (vec[j] == 1) return make_pair(2, iord[i]);
    }
    return bad;
}

void program_pulibot()
{
    bool found = false;
    for (int now = 0; now <= 1; now++) {
        for (int w = -2; w <= 2; w++) {
            for (int s = -2; s <= 2; s++) {
                for (int e = -2; e <= 2; e++) {
                    for (int n = -2; n <= 2; n++) {
                        auto it = get(now, w, s, e, n);
                        if (it.first == -1) continue;
                        set_instruction({now, w, s, e, n}, it.first, it.second);
                    }
                }
            }
        }
    }
    // cout << found << endl;
}

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