蓝桥杯-兰顿蚂蚁 (模拟)

兰顿蚂蚁

---

兰顿蚂蚁的移动规则 :
若蚂蚁在黑格，右转90度，将该格改为白格，并向前移一格；
若蚂蚁在白格，左转90度，将该格改为黑格，并向前移一格。

开始我还在想怎么写可以过大数据….
后面才想到..这个问题再大也是O(n)啊..

import java.util.Scanner;

public class Ant {
    public static final int[][] U_R_D_L = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
    public static boolean[][] map;
    public static int antHead; //头的方向,0为上,1为右...
    public static int k;

    public static void deal(int x, int y, int step) {
        if (step == k) {
            System.out.println(x + " " + y);
            return;
        }
        //掉头,true表示黑,false表示白
        if (map[x][y]) {
            antHead = (antHead + 1) % 4;
        } else {
            antHead = (antHead + 3) % 4;
        }
        map[x][y] = !map[x][y]; //反转
        deal(x + U_R_D_L[antHead][0], y + U_R_D_L[antHead][1], step + 1); //将下一步传入,递归处理
    }

    public static void main(String s[]) {
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        int y = scanner.nextInt();
        scanner.nextLine();
        map = new boolean[x][y];
        for (int i = 0; i < x; i++) {
            for (int j = 0; j < y; j++) {
                if (scanner.nextInt() == 1) {
                    map[i][j] = true;
                }
            }
            scanner.nextLine();
        }
        int firstX = scanner.nextInt();
        int firstY = scanner.nextInt();
        antHead = "URDL".indexOf(scanner.next().charAt(0));
        k = scanner.nextInt();
        deal(firstX, firstY, 0);
    }
}