Submission #1078344

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078344		c2zi6	Robot Contest (IOI23_robot)	C++17	6 / 100	111 ms	5872 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 3
        int COLOR = 15;
        char DIRECTION = 'T';
        bool maqrel = false;
        bool het = false;
BEGINNING:
        if (W == 1) het = true;
        if (S == 1) het = true;
        if (E == 1) het = true;
        if (N == 1) het = true;
        
        if (CUR == 3) maqrel = true;
        if (W == 4) maqrel = true;
        if (S == 4) maqrel = true;
        if (E == 4) maqrel = true;
        if (N == 4) maqrel = true;

        if (maqrel) {
            COLOR = 4;
            move(3)else {
                COLOR = 0;
                move(4)else {
                }
            }
        } else if (het) {
            COLOR = 4;
            move(3)else {
                COLOR = 1;
                move(2)
            }
        } else {
            if (E == -2 && S == -2) {
                het = true;
                goto BEGINNING;
            }
            COLOR = 2;
            move(0)else {
                COLOR = 3;
                move(2)
            }
        }
*/

#define move(x)\
            if (E == x) DIRECTION = 'E';\
            else if (N == x) DIRECTION = 'N';\
            else if (S == x) DIRECTION = 'S';\
            else if (W == x) DIRECTION = 'W';\

void program_pulibot() {
    int MAXZ = 4;
    replr(CUR, 0, MAXZ) replr(N, -2, MAXZ) replr(E, -2, MAXZ) replr(S, -2, MAXZ) replr(W, -2, MAXZ) {
        VI INSTRUCTION = {CUR, W, S, E, N};
        int COLOR = 15;
        char DIRECTION = 'T';

        bool het;
        het = false;
        if (W == 1) het = true;
        if (S == 1) het = true;
        if (E == 1) het = true;
        if (N == 1) het = true;

        if (CUR == 4) {
            COLOR = 4;
            move(2)else {
                COLOR = 0;
                move(4)else {
                    move(3)else {
                    }
                }
            }
        } else if (CUR == 2) {
            COLOR = 4;
            move(2)else {
                COLOR = 0;
                move(4)else {
                }
            }
        } else if (het) {
            COLOR = 3;
            move(2)else {
                COLOR = 1;
                move(3)
            }
        } else if (E == -2 && S == -2) {
            COLOR = 1;
            move(3)else {
            }
        } else {
            COLOR = 3;
            if (E == 0) DIRECTION = 'E';
            else if (S == 0) DIRECTION = 'S';
            else {
                COLOR = 2;
                move(3)else {
                }
            }
        }

        set_instruction(INSTRUCTION, COLOR, DIRECTION);
    }
}

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