【AC梦工厂】广工华工联合训练1 H - Programming a robot

传送门:https://vjudge.net/contest/188332#problem/H

题目大意

给你一个机器人,只能右转和执行,给定初始坐标和重点坐标,求出操作数和方法。

题解

你懂的,就是暴力枚举所有情况;点在左上角,右上角,右下角,左下角全部枚举一次,注意同一平行线时候的情况就可以了。

代码

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int ppp(char p)
{
    if(p=='N')
        return 1;
    else if(p=='E')
        return 2;
    else if(p=='S')
        return 3;
    else
        return 4;
}
int main()
{
    int sx,sy,ex,ey;
    char po;
    scanf("%d %d %c",&sx,&sy,&po);
    scanf("%d%d",&ex,&ey);
    int pos=ppp(po);
    if(sx==ex&&sy==ey)
    {
        printf("0\n");
        return 0;
    }
    if(sx>ex&&sy<ey)
    {
        if(pos==1)
        {
            printf("5\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==2)
        {
            printf("5\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }else if(pos==3)
        {
            printf("4\n");
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }else if(pos==4)
        {
            printf("3\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }
    }else if(sx<ex&&sy<ey){
        if(pos==1)
        {
            printf("3\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==2)
        {
            printf("5\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }else if(pos==3)
        {
            printf("5\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==4)
        {
            printf("4\n");
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }
    }else if(sx<ex&&sy>ey){
        if(pos==1)
        {
            printf("4\n");
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }else if(pos==2)
        {
            printf("3\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }else if(pos==3)
        {
            printf("5\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==4)
        {
            printf("5\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }
    }else if(sx>ex&&sy>ey){
        if(pos==1)
        {
            printf("5\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==2)
        {
            printf("4\n");
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==3)
        {
            printf("3\n");
            printf("A %d\n",abs(sy-ey));
            printf("D\n");
            printf("A %d\n",abs(sx-ex));
        }else if(pos==4)
        {
            printf("5\n");
            printf("A %d\n",abs(sx-ex));
            printf("D\n");
            printf("D\n");
            printf("D\n");
            printf("A %d\n",abs(sy-ey));
        }
    }else if(sx==ex)
    {
        int epos;
        if(sy>ey)
            epos=3;
        else
            epos=1;
        printf("%d\n",(epos-pos<0?epos+4-pos:epos-pos)+1);
        int p=(epos-pos<0?epos+4-pos:epos-pos);
        for(int i=0;i<p;i++)
        {
            printf("D\n");
        }
        printf("A %d\n",abs(sy-ey));
    }else if(sy==ey)
    {
        int epos;
        if(sx>ex)
            epos=4;
        else
            epos=2;
        printf("%d\n",(epos-pos<0?epos+4-pos:epos-pos)+1);
        int p=(epos-pos<0?epos+4-pos:epos-pos);
        for(int i=0;i<p;i++)
        {
            printf("D\n");
        }
        printf("A %d\n",abs(sx-ex));
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值