제출 #1298611

#제출 시각아이디문제언어결과실행 시간메모리
1298611khoavn2008Robot Contest (IOI23_robot)C++17
0 / 100
35 ms7504 KiB
#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
#define FORNG(i,r,l) for(int i = (r), _l = (l); i >= _l; i--)
#define REP(i,r) for(int i = 0, _r = (r); i < _r; i++)
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define size(v) ((ll)(v).size())
#define all(v) (v).begin(),(v).end()
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
const ll MOD = 1e9 + 7, N = 2e5 + 36, LOG = 18;
const ll INF = 1e18 + 36;
/*
    4
  1 0 3
    2
*/
void program_pulibot(){
    FOR(W,-2,1)FOR(S,-2,1)FOR(E,-2,1)FOR(N,-2,1){
        if(S == -2){
            set_instruction({0, W, S, E, N}, 1, 'H');
            continue;
        }
        if(E == -2){
            set_instruction({0, W, S, E, N}, 1, 'S');
        }else if(N == -2){
            set_instruction({0, W, S, E, N}, 1, 'E');
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...