模拟 HDOJ 4552 Running Rabbits

 

题目传送门

/*
    模拟：看懂题意，主要是碰壁后的转向，笔误2次
*/
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;

const int MAXN = 1e3 + 10;
const int INF = 0x3f3f3f3f;
struct Rabbit
{
    char c;
    int d, s, t;
    int x, y;
}r[3];

int main(void)        //HDOJ 4552 Running Rabbits
{
//    freopen ("K.in", "r", stdin);

    int n;
    while (scanf ("%d", &n) == 1)
    {
        if (n == 0)    break;
        getchar ();
        for (int i=1; i<=2; ++i)
        {
            scanf ("%c %d %d", &r[i].c, &r[i].s, &r[i].t);
            if (r[i].c == 'E')    r[i].d = 0;
            else if (r[i].c == 'N')    r[i].d = 1;
            else if (r[i].c == 'W')    r[i].d = 2;
            else    r[i].d = 3;
            getchar ();
        }
        int k;    scanf ("%d", &k);
        r[1].x = r[1].y = 1;    r[2].x = r[2].y = n;

        for (int i=1; i<=k; ++i)
        {
            for (int j=1; j<=2; ++j)
            {
                if (r[j].d == 0)
                {
                    if (r[j].y + r[j].s > n)
                    {
                        r[j].y = 2 * n - (r[j].y + r[j].s);
                        r[j].d = 2;
                    }
                    else    r[j].y += r[j].s;
                }
                else if (r[j].d == 1)
                {
                    if (r[j].x - r[j].s < 1)
                    {
                        r[j].x = 2 + r[j].s - r[j].x;
                        r[j].d = 3;
                    }
                    else    r[j].x -= r[j].s;
                }
                else if (r[j].d == 2)
                {
                    if (r[j].y - r[j].s < 1)
                    {
                        r[j].y = 2 + r[j].s - r[j].y;
                        r[j].d = 0;
                    }
                    else    r[j].y -= r[j].s;
                }
                else if (r[j].d == 3)
                {
                    if (r[j].x + r[j].s > n)
                    {
                        r[j].x = 2 * n - (r[j].x + r[j].s);
                        r[j].d = 1;
                    }
                    else    r[j].x += r[j].s;
                }
            }

            if (r[1].x == r[2].x && r[1].y == r[2].y)    swap (r[1].d, r[2].d);
            else
            {
                if (i % r[1].t == 0)    r[1].d = (r[1].d + 1) % 4;
                if (i % r[2].t == 0)    r[2].d = (r[2].d + 1) % 4;
            }
        }

        for (int i=1; i<=2; ++i)    printf ("%d %d\n", r[i].x, r[i].y);
    }

    return 0;
}