이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
const int MAXN = -1;
const int inf=1000000500ll;
const long long oo =1000000000000000500ll;
const int MOD = (int)1e9+7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi;
void program_pulibot()
{
for(int north=-2;north<=2;north++){
for(int west=-2;west<=2;west++){
for(int south=-2;south<=2;south++){
for(int east=-2;east<=2;east++){
for(int here=-2;here<=2;here++){
if(east == -2 && south == -2){
set_instruction({here,west,south,east,north},1,'T');
} else if(east == 0){
set_instruction({here,west,south,east,north},1,'E');
} else if(south == 0){
set_instruction({here,west,south,east,north},1,'S');
} else if(north == 1){
set_instruction({here,west,south,east,north},2,'N');
} else if(west == 1){
set_instruction({here,west,south,east,north},2,'W');
}
}
}
}
}
}
}
# | 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... |