Programming a robot

题目链接：Gym - 101492H

自己的纯暴力做法：

 /* */
 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <string>
 # include <cstdlib>
 # include <cmath>
 # include <ctime>
 # include <climits>
 # include <memory>
 # include <functional>
 # include <algorithm>
 # include <bitset>
 # include <set>
 # include <map>
 # include <stack>
 # include <vector>
 # include <deque>
 # include <queue>
 # include <iomanip>
 # include <utility>
 using namespace std;

 # define lson l,m,rt<<
 # define rson r,m+,rt<<|
 # define lowbit(x) (x&(-x))
 # define lcm(a,b) (a*b/__gcd(a,b))
 typedef long long ll;
 const ll mod=1e9+;
 const int maxn=;
 const double pi=acos(-1.0);
 const int eps=1e-;

 int main()
 {
     char c;
     ll x0, y0, xd, yd;
     int flag1=-, flag2=-;
     scanf("%lld %lld %c", &x0, &y0, &c);
     scanf("%lld %lld", &xd, &yd);

     ll x=xd-x0;
     ll y=yd-y0;
     if( x== && y== )//在原位
     {
         printf("0\n");
     }

     else if( x== && y> )//在上方
     {
         if( c=='N' )
         {
             //printf("%lld\n", y);
             printf("1\n");
             printf("A %lld\n", y);
         }
         else if( c=='E' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", y);
         }

         else if( c=='S' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", y);
         }

         else if( c=='O')
         {
             printf("%d\n", +);
             printf("D\n");
             printf("A %lld\n", y);
         }
     }

     else if( x== && y< )//在下方
     {
         y = -y;
         if( c=='S')
         {
             printf("1\n");
             printf("A %lld\n", y);
         }

         else if( c=='E' )
         {
             printf("%d\n", +);
             printf("D\n");
             printf("A %lld\n", y);
         }

         else if( c=='N' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", y);
         }

         else if( c=='O' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", y);
         }
     }

     else if( x> && y== )//在右边
     {
         if( c=='E' )
         {
             printf("1\n");
             printf("A %lld\n", x);
         }

         else if( c=='S' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", x);
         }

         else if( c=='O' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", x);
         }

         else if( c=='N' )
         {
             printf("%d\n", +);
             printf("D\n");
             printf("A %lld\n", x);
         }
     }

     else if(x< && y== )//在左边
     {
         x=-x;
         if( c=='O' )
         {
             printf("1\n");
             printf("A %lld\n", x);
         }

         else if( c=='N' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", x);
         }

         else if( c=='E' )
         {
             printf("%d\n", +);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", x);
         }

         else if( c=='S' )
         {
             printf("%d\n", +);
             printf("D\n");
             printf("A %lld\n", x);
         }
     }

     else if( x> && y> )//在右上方
     {
         if( c=='N' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", y);
             printf("D\n");
             printf("A %lld\n", x);
         }

         else if( c=='E' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", x);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", y);
         }

         else if( c=='S' )
         {
             printf("%d\n", +++);
             printf("D\n");
             printf("D\n");
             printf("A %lld\n", y);
             printf("D\n");
             printf("A %lld\n", x);
         }

         else if( c=='O')
         {
             printf("%d\n", +++);
             printf("D\n");
             printf("A %lld\n", y);
             printf("D\n");
             printf("A %lld\n", x);
         }
     }

     else if( x> && y< )//在右下
     {
         y=-y;
         if( c=='S' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", y);
             for(int i=; i<; i++ )
             {
                 printf("D\n");
             }
             printf("A %lld\n", x);
         }

         if( c=='O')
         {
             printf("%d\n", +++);
             printf("D\nD\n");
             printf("A %lld\n", x);
             printf("D\n");
             printf("A %lld\n", y);
         }

         if( c=='N' )
         {
             printf("%d\n", +++);
             printf("D\n");
             printf("A %lld\n", x);
             printf("D\n");
             printf("A %lld\n", y);
         }

         if( c=='E' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", x);
             printf("D\n");
             printf("A %lld\n", y);
         }
     }

     else if( x< && y< )
     {
         x = -x;
         y = -y;
         if( c=='S' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", y);
             printf("D\n");
             printf("A %lld\n", x);
         }

         if( c=='O' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", x);
             printf("D\nD\nD\n");
             printf("A %lld\n", y);
         }

         if( c=='N' )
         {
             printf("%d\n", +++);
             printf("D\nD\n");
             printf("A %lld\n", y);
             printf("D\n");
             printf("A %lld\n", x);
         }

         if( c=='E' )
         {
             printf("%d\n", +++);
             printf("D\n");
             printf("A %lld\n", y);
             printf("D\n");
             printf("A %lld\n", x);
         }
     }

     else if( x< && y> )//在左上
     {
         x=-x;
         if( c=='N' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", y);
             printf("D\nD\nD\n");
             printf("A %lld\n", x);
         }

         if( c=='E' )
         {
             printf("%d\n", +++);
             printf("D\nD\n");
             printf("A %lld\n", x);
             printf("D\n");
             printf("A %lld\n", y);
         }

         if( c=='S' )
         {
             printf("%d\n", +++);
             printf("D\n");
             printf("A %lld\n", x);
             printf("D\n");
             printf("A %lld\n", y);
         }

         if( c=='O' )
         {
             printf("%d\n", ++);
             printf("A %lld\n", x);
             printf("D\n");
             printf("A %lld\n", y);
         }
     }
     return ;
 }

后来看别人的代码才知道“模拟”

 /* */
 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <string>
 # include <cstdlib>
 # include <cmath>
 # include <ctime>
 # include <climits>
 # include <memory>
 # include <functional>
 # include <algorithm>
 # include <bitset>
 # include <set>
 # include <map>
 # include <stack>
 # include <vector>
 # include <deque>
 # include <queue>
 # include <iomanip>
 # include <utility>
 using namespace std;

 # define lson l,m,rt<<
 # define rson r,m+,rt<<|
 # define lowbit(x) (x&(-x))
 # define lcm(a,b) (a*b/__gcd(a,b))
 typedef long long ll;
 const ll mod=1e9+;
 const int maxn=;
 const double pi=acos(-1.0);
 const int eps=1e-;

 char s[]={'N', 'E', 'S', 'O', 'N', 'E', 'S'};

 int _find(char c, int k)
 {
     for(int i=; s[i]!='\0'; i++ )
         if( s[i]==c && i>=k )
         return i;
 }

 int main()
 {
     int a, b, x, y;
     char m, n, c;
     while( cin>>x>>y>>c>>a>>b )
     {
         int k1=_find(c, ), k2, k3;

         if( a==x )
             k2=;
         if( b==y )
             k3=;

         if( a!=x && b!=y )
         {
             if( a>x )//右
             {
                 m='E';
                 if( b>y )//上
                     n='N';
                 else if( b<y )//下
                     n='S';
             }
             else if( a<x )//左
             {
                 m='O';
                 if( b>y )//上
                     n='N';
                 else if( b<y )//下
                     n='S';
             }

             k2 = _find(n, k1)-k1;
             k3 = _find(m, k1)-k1;
             cout<<max(k2, k3)+<<endl;//max(k2,k3)是求一定要转够的书,2是两次直走步骤
             int px=fabs(x-a);
             int py=fabs(y-b);

             if( k2>k3 )
             {
                 for(int i=; i<k3; i++ )
                 {
                     cout<<"D"<<endl;//转到要转的方向才可以走
                 }
                 cout<<"A "<<px<<endl;
                 for(int i=k3; i<k2; i++ )
                     cout<<"D"<<endl;
                 cout<<"A "<<py<<endl;
             }

             else
             {
                 for(int i=; i<k2; i++ )
                     cout<<"D"<<endl;
                 cout<<"A "<<py<<endl;
                 for(int i=k2; i<k3; i++ )
                     cout<<"D"<<endl;
                 cout<<"A "<<px<<endl;
             }
         }

         else
         {
             if( x==a&&y==b )
                 cout<<<<endl;

             else if( x==a )
             {
                 if( b>y )//正上方
                     n='N';
                 else//正下方
                     n='S';

                 k2=_find(n, k1)-k1;
                 cout<<k2+<<endl;
                 for(int i=; i<k2; i++ )
                     cout<<"D"<<endl;
                 cout<<"A "<<fabs(b-y)<<endl;
             }
             else if( y==b )
             {
                 if( a>x )
                     m='E';
                 else
                     m='O';
                 k3=_find(m,k1)-k1;
                 cout<<k3+<<endl;
                 for(int i=; i<k3; i++ )
                     cout<<"D"<<endl;
                 cout<<"A "<<fabs(a-x)<<endl;
             }
         }
     }
     return ;
 }