Submission #1243807

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243807		porquenomedejainiciarsesion	Robot Contest (IOI23_robot)	C++20	0 / 100	71 ms	6216 KiB

robot

#include "robot.h"
#include <bits/stdc++.h>
using namespace std;
//actual
//oeste
//sur
//este
//norte
void create(int ac,int oe,int su,int es,int no){
    bool explore=false;
    vector<int> V={oe,su,es,no};
    vector<char> L={'W','S','E','N'};
    if(ac==6){
        if(es==-2 && su==-2){
            set_instruction({ac,oe,su,es,no},1,'T');
            return;
        }
        for(int i=0;i<4;i++){
            if(V[i]==6){
                set_instruction({ac,oe,su,es,no},1,L[i]);
                return;
            }
        }
    }
    if(ac==1 || ac==5){
        if(oe==-2 && no==-2 && ac==5){
            set_instruction({ac,oe,su,es,no},6,'H');
            return;
        }
        if(su==-2 && es==-2){
            for(int i=0;i<4;i++){
                if(V[i]==5){
                    set_instruction({ac,oe,su,es,no},6,L[i]);
                    return;
                }
            }
        }
        bool seis=false;
        for(int i=0;i<4;i++){
            if(V[i]==6){
                seis=true;
            }
        }
        if(seis){
            for(int i=0;i<4;i++){
            if(V[i]==5){
                set_instruction({ac,oe,su,es,no},6,L[i]);
                return;
            }
            }
        }
        for(int i=0;i<4;i++){
            if(V[i]==3){
                set_instruction({ac,oe,su,es,no},5,L[i]);
                return;
            }
        }
        for(int i=0;i<4;i++){
            if(V[i]==1){
                set_instruction({ac,oe,su,es,no},5,L[i]);
                return;
            }
        }
    }
    if(ac==3){
        for(int i=0;i<4;i++){
            if(V[i]==3){
                set_instruction({ac,oe,su,es,no},4,L[i]);
                return;
            }
        }
        for(int i=0;i<4;i++){
            if(V[i]==4){
                set_instruction({ac,oe,su,es,no},0,L[i]);
                return;
            }
        }
        set_instruction({ac,oe,su,es,no},4,'H');
        return;
    }
    if(ac==4){
        for(int i=0;i<4;i++){
            if(V[i]==3){
                set_instruction({ac,oe,su,es,no},4,L[i]);
                return;
            }
        }
        for(int i=0;i<4;i++){
            if(V[i]==4){
                set_instruction({ac,oe,su,es,no},0,L[i]);
                return;
            }
        }
        for(int i=0;i<4;i++){
            if(V[i]==5){
                set_instruction({ac,oe,su,es,no},0,L[i]);
                return;
            }
        }
    }
    for(int i=0;i<4;i++){
        if(V[i]==0){
            set_instruction({ac,oe,su,es,no},2,L[i]);
            explore=true;
            break;
        }
    }
    if(!explore){
        bool ok=false;
        for(int i=0;i<4;i++){
        if(V[i]==1){
            ok=true;
            break;
        }
        }
        if((es==-2 && su==-2) || ok){
            if(oe==-2 && no==-2){
                set_instruction({ac,oe,su,es,no},1,'H');
            }else{
                for(int i=0;i<4;i++){
                    if(V[i]==2){
                        set_instruction({ac,oe,su,es,no},1,L[i]);
                        explore=true;
                        break;
                    }
                }
            }
        }else{
            for(int i=0;i<4;i++){
                if(V[i]==2){
                    set_instruction({ac,oe,su,es,no},3,L[i]);
                    explore=true;
                    break;
                }
            }
        
        }
    }
}
void program_pulibot()
{
    for (int a = -2; a <= 6; a++) {
        for (int b = -2; b <= 6; b++) {
            for (int c = -2; c <= 6; c++) {
                for (int d = -2; d <= 6; d++) {
                    for (int e = -2; e <= 6; e++) {
                        create(a,b,c,d,e);
                    }
                }
            }
        }
    }
}

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