Submission #1240635

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240635		MarwenElarbi	Robot Contest (IOI23_robot)	C++17	6 / 100	67 ms	5960 KiB

robot

#include <bits/stdc++.h>
#include "robot.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
const int nax = 5e5+5;
void program_pulibot()
{
  char to[5];
  to[1]='W';
  to[2]='S';
  to[3]='E';
  to[4]='N';
  for (int i = -2; i <= 5; ++i)
  {
    for (int j = -2; j <= 5; ++j)
    {
      for (int k = -2; k <= 5; ++k)
      {
        for (int t = -2; t <= 5; ++t)
        {
          for (int l = 0; l <= 5; ++l)
          {
            vector<int> cur = {l,i,j,k,t};
            if(j==-2&&k==-2){
              for (int x = 1; x < 5; ++x)
              {
                if(cur[x]>0) {
                  set_instruction(cur,1,to[x]);
                  break;
                }
              }
              break;
            }
            bool test=false;
            bool test1=false;
            for (int x = 1; x < 5; ++x)
            {
              test1|=(cur[x]==1);
            }
            if(test1){
                bool nabba=false;
                for (int x = 1; x < 5; ++x)
                {
                  if(x==2||x==3) continue;
                  if(cur[x]>1){
                    nabba=true;
                    set_instruction(cur,1,to[x]);
                    break;
                  }
                }
              if(!nabba) set_instruction(cur,1,'T');
            }else{
                for (int x = 1; x < 5; ++x)
                {
                  if(x==1||x==4) continue;
                  if(cur[0]>x) continue;
                  if(cur[x]==0){
                    test=true;
                    set_instruction(cur,x+1,to[x]);
                    break;
                  }
                }
                if(!test){
                  for (int x = 1; x < 5; ++x)
                  {
                    if(x==2||x==3) continue;
                    if(cur[x]>1){
                      set_instruction(cur,0,to[x]);
                      break;
                    }
                  }
                }
            } 
          }
        }
      }
    }
  }
}

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