Submission #1229757

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229757		virgoliny	Robot Contest (IOI23_robot)	C++20	10 / 100	65 ms	5656 KiB

robot

#include "robot.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define vll vector<ll>
#define sd second
#define ft first
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pll pair<ll, ll>
#define mod 1000000007
#define _set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>
#define inf (ll)1e15
#define db(x) cout<<#x<<" : "<<x<<endl;
#define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x);
using namespace std;
using namespace __gnu_pbds;
ll dx[]={1, -1, 0, 0};
ll dy[]={0, 0, 1, -1};
inline ll sm(ll a, ll b){
return ((a%mod)+(b%mod))%mod;
}
inline ll ml(ll a, ll b){
return ((a%mod)*(b%mod))%mod;
}
inline ll rs(ll a, ll b){
return ((a%mod)-(b%mod)+mod)%mod;
}
ll bpow(ll a , ll b) {
if (b==0)return 1;
if (b%2!=0)return ((bpow(a, b-1)%mod)*(a%mod))%mod;
ll r=bpow (a ,b/ 2) ;
return ((r%mod)*(r%mod))%mod;
}
void program_pulibot(){
    vector<int> v(5);
    for(int i=-2; i<=1; i++)
    for(int j=-2; j<=1; j++)
    for(int k=-2; k<=1; k++){
    v[0]=0;
    v[1]=i;
    v[2]=j;
    v[3]=0;
    v[4]=k;
    set_instruction(v, 1, 'E');
    }
    for(int i1=-2; i1<=-1; i1++)
    for(int i=-2; i<=1; i++){
    v[0]=0;
    v[1]=i;
    v[2]=0;
    v[3]=i1;
    v[4]=-2;
    set_instruction(v, 1, 'S');
    }
    for(int i1=-1; i1<=-1; i1++)
    for(int i=-2; i<=1; i++){
    v[0]=0;
    v[1]=i;
    v[2]=-2;
    v[3]=i1;
    v[4]=0;
    set_instruction(v, 1, 'N');
    }
    for(int i=-2; i<=1; i++)
    for(int k=-2; k<=1; k++){
    v[0]=0;
    v[1]=i;
    v[2]=-2;
    v[3]=-2;
    v[4]=k;
    set_instruction(v, 1, 'T');
    }
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 10 / 10
• Subtask 3: 0 / 18
• Subtask 4: 0 / 20
• Subtask 5: 0 / 46