Submission #884832

#	Time	Username	Problem	Language	Result	Execution time	Memory
884832		irmuun	Robot Contest (IOI23_robot)	C++17	0 / 100	87 ms	5880 KiB

robot

#include<bits/stdc++.h>
#include "robot.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

//west-zuun
//south-dood
//east-baruun
//north-deed
string s="TWSEN";
vector<int>u[5];

void program_pulibot(){
    u[0]={1,2,3,4};
    u[1]={2,3,4,1};
    u[2]={3,4,2,1};
    u[3]={4,1,2,3};
    u[4]={1,2,3,4};
    vector<int>v(5);
    v[0]=0;
    for(v[0]=0;v[0]<=4;v[0]++){
        for(v[1]=-2;v[1]<=4;v[1]++){
            for(v[2]=-2;v[2]<=4;v[2]++){
                for(v[3]=-2;v[3]<=4;v[3]++){
                    for(v[4]=-2;v[4]<=4;v[4]++){
                        if(v[1]==-2&&v[2]==-2){
                            set_instruction(v,0,s[0]);
                            continue;
                        }
                        bool found=false;
                        int nxt,f=-1;
                        for(int i=0;i<4;i++){
                            if(v[u[v[0]][i]]==0){
                                nxt=u[v[0]][i];
                                found=true;
                                break;
                            }
                            if(u[v[0]][i]>=0&&f==-1){
                                f=u[v[0]][i];
                            }
                        }
                        if(found){
                            set_instruction(v,nxt,s[nxt]);
                        }
                        else{
                            set_instruction(v,f,s[f]);
                        }
                    }
                }
            }
        }
    }
}

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