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 vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;
void program_pulibot()
{
vi a={-2,-1,0,2,1};
int n=5;
map<vi,int> mp;
REP(i,0,n)REP(j,0,n){
vi t={0,a[i],-2,-2,a[j]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'T');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={0,a[i],a[j],0,a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'E');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={0,a[i],0,a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'S');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={0,a[i],a[j],a[k],0};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'N');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={0,0,a[i],a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'W');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={1,a[i],a[j],0,a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'E');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={1,a[i],0,a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'S');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={1,a[i],a[j],a[k],0};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'N');
}
REP(i,0,n)REP(j,0,n)REP(k,0,n){
vi t={1,0,a[i],a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,1,'W');
}
REP(i,0,3)REP(j,0,3)REP(k,0,3){
vi t={0,1,a[i],a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'W');
}
REP(i,0,3)REP(j,0,3)REP(k,0,3){
vi t={0,a[i],1,a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'S');
}
REP(i,0,3)REP(j,0,3)REP(k,0,3){
vi t={0,a[i],a[j],1,a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'E');
}
REP(i,0,3)REP(j,0,3)REP(k,0,3){
vi t={0,a[i],a[j],a[k],1};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'N');
}
REP(i,0,n-1)REP(j,0,n-1)REP(k,0,n-1){
vi t={1,a[i],a[j],a[k],1};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'N');
}
REP(i,0,n-1)REP(j,0,n-1)REP(k,0,n-1){
vi t={1,a[i],a[j],1,a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'E');
}
REP(i,0,n-1)REP(j,0,n-1)REP(k,0,n-1){
vi t={1,a[i],1,a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,2,'S');
}
REP(i,0,n-1)REP(j,0,n-1)REP(k,0,n-1){
vi t={1,1,a[i],a[j],a[k]};
if(mp[t])continue;
mp[t]=1;
set_instruction(t,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... |