이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"
const int N = 5e3 + 9 , mod = 1e9 + 7;
ll a[N] , b[N] , dp[N][N] , c[N] , d[N] ;
void program_pulibot(){
for(int h = -2; h <= 2; h++) {
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++) {
vector<int>a = {h , w , s , e , n};
if(e == 0)
set_instruction(a , 1 , 'E');
else if(s == 0)
set_instruction(a , 1 , 'S');
else if(n == 0)
set_instruction(a , 1 , 'N');
else
set_instruction(a , 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... |