Submission #1024922

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024922		j_vdd16	Robot Contest (IOI23_robot)	C++17	0 / 100	94 ms	5720 KiB

robot

#include "robot.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

void decide(int cur, int east, int south, int west, int north) {
    vi instruction = { cur, east, south, west, north };
    if (east == -2 && south == -2) {
        set_instruction(instruction, 1, 'T');
        return;
    }

    north = max(north, -1);
    east = max(east, -1);
    south = max(south, -1);
    west = max(west, -1);

    if (east == 0) {
        set_instruction(instruction, 1, 'E');
    }
    else if (south == 0) {
        set_instruction(instruction, 1, 'S');
    }
    else if (north == 0) {
        set_instruction(instruction, 1, 'N');
    }
    else {
        set_instruction(instruction, 1, 'H');
    }
}

constexpr int Z_MAX = 1;
void program_pulibot() {
    for (int cur = -2; cur <= Z_MAX; cur++) {
        for (int east = -2; east <= Z_MAX; east++) {
            for (int south = -2; south <= Z_MAX; south++) {
                for (int west = -2; west <= Z_MAX; west++) {
                    for (int north = -2; north <= Z_MAX; north++) {
                        decide(cur, east, south, west, north);
                    }
                }
            }
        }
    }
}

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