Submission #1078151

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078151		c2zi6	Robot Contest (IOI23_robot)	C++17	16 / 100	108 ms	5648 KiB

robot

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "robot.h"

/*
    TEST 2
    if (E == -2) {
        COLOR = 1;
        if (S == -2) DIRECTION = 'T';
        else DIRECTION = 'S';
    } else if (N == -2) {
        COLOR = 1;
        DIRECTION = 'E';
    }
*/
void program_pulibot() {
    replr(cur, 0, 0) replr(N, -2, 1) replr(E, -2, 1) replr(S, -2, 1) replr(W, -2, 1) {
        VI INSTRUCTION = {cur, W, S, E, N};
        int COLOR;
        char DIRECTION;
        COLOR = 1;
        if (E == -2 && S == -2) {
            DIRECTION = 'T';
        } else {
            if (E == 0) DIRECTION = 'E';
            else {
                if (N == 0) DIRECTION = 'N';
                else if (S == 0) DIRECTION = 'S';
                else DIRECTION = 'W';
            }
        }


        set_instruction(INSTRUCTION, COLOR, DIRECTION);
    }
}

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