This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "robot.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll NN = 2e5 + 5;
void program_pulibot()
{
for(int now = -2; now <= 2; 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++)
{
int war = 1;
char arah = 'W';
if(S == -2 && E == -2)arah = 'T';
else if(E == 0)arah = 'E';
else if(S == 0)arah = 'S';
else if(W == 0)arah = 'W';
else if(N == 0)arah = 'N';
set_instruction({now, W, S, E, N}, war, arah);
}
// set_instruction({0, 1, -1, 0, -2}, 1, 'E');
// set_instruction({0, 1, 0, -2, -2}, 1, 'S');
// set_instruction({0, -1, -2, -2, 1}, 1, 'T');
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |