Submission #1248036

#	Time	Username	Problem	Language	Result	Execution time	Memory
1248036		simplemind_31	Robot Contest (IOI23_robot)	C++20	16 / 100	70 ms	5448 KiB

robot

#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
set<vector<int>> existe;
void program_pulibot(){
    //iniciar
    vector<int> tapado={-1,-2};
    vector<int> todo={0,1,-1,-2};
    //left
    for(auto i:todo){
        // down
        //for(auto j:tapado){
            //right
            //for(auto k:tapado){
                //up
                for(auto l:todo){
                    if(existe.count({0,i,-2,-2,l})==0){
                        existe.insert({0,i,-2,-2,l});
                        set_instruction({0,i,-2,-2,l},1,'T');
                    }
                }
            //}
        //}
    }
    for(auto i:todo){
        // down
        for(auto j:todo){
            //right
            //for(auto k:todo){
                //up
                for(auto l:todo){
                    if(existe.count({0,i,j,0,l})==0){
                        existe.insert({0,i,j,0,l});
                        set_instruction({0,i,j,0,l},1,'E');
                    }
                }
            //}
        }
    }
    for(auto i:todo){
        // down
        //for(auto j:todo){
            //right
            for(auto k:todo){
                //up
                for(auto l:todo){
                    if(existe.count({0,i,0,k,l})==0){
                        existe.insert({0,i,0,k,l});
                        set_instruction({0,i,0,k,l},1,'S');
                    }
                }
            }
        //}
    }
    for(auto i:todo){
        // down
        for(auto j:todo){
            //right
            for(auto k:todo){
                //up
                //for(auto l:todo){
                    if(existe.count({0,i,j,k,0})==0){
                        existe.insert({0,i,j,k,0});
                        set_instruction({0,i,j,k,0},1,'N');
                    }
                //}
            }
        }
    }
}

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