이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "robot.h"
#include<bits/stdc++.h>
#include<random>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)
#define sq 547
using namespace std;
void program_pulibot()
{
for(int i = -2 ; 1>=i ; i++)
{
for(int j = -2 ; 1>=j ; j++)
{
vector<int> S;
S={0,i,-2,0,j};
set_instruction(S,1,'E');
}
}
set_instruction({0,1,-2,-1,-1},0,'W');
set_instruction({0,1,-2,-1,0},0,'N');
set_instruction({1,1,-2,0,-1},0,'W');
for(int i = -2 ; 1>=i ; i++)
{
for(int j = -2 ; 1>=j ; j++)
{
vector<int> S;
S={1,i,-2,j,1};
set_instruction(S,0,'N');
}
}
for(int i = -2 ; 1>=i ; i++)
{
for(int j = -2 ; 1>=j ; j++)
{
vector<int> S;
S={0,i,0,j,-2};
set_instruction(S,1,'S');
}
}
for(int i = -2 ; 1>=i ; i++)
{
vector<int> S;
S={1,i,0,0,-2};
set_instruction(S,1,'E');
}
for(int i = -2 ; 1>=i ; i++)
{
vector<int> S;
S={0,i,-1,0,-2};
set_instruction(S,1,'E');
}
for(int i = -2 ; 1>=i ; i++)
{
for(int j = -2 ; 1>=j ; j++)
{
vector<int> S;
S={0,i,-2,-2,j};
set_instruction(S,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... |