兰顿蚂蚁(自己的笨解法)

看看图一乐，还是要扣扣DFS

#include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <limits.h>

using namespace std;

struct A {
	int x, y;
	char head;
};

int map[105][105];

A move(int x,int y,char h, int color) {
	A mov;
	if (color == 0) {
		if (h == 'U') {
			mov.x = 0;
			mov.y = -1;
			mov.head = 'L';
		}
		if (h == 'L') {
			mov.x = 1;
			mov.y = 0;
			mov.head = 'D';
		}
		if (h == 'D') {
			mov.x = 0;
			mov.y = 1;
			mov.head = 'R';
		}
		if (h == 'R') {
			mov.x = -1;
			mov.y = 0;
			mov.head = 'U';
		}
		map[x][y] = 1;
	}
	if (color == 1) {
		if (h == 'U') {
			mov.x = 0;
			mov.y = 1;
			mov.head = 'R';
		}
		if (h == 'L') {
			mov.x = -1;
			mov.y = 0;
			mov.head = 'U';
		}
		if (h == 'D') {
			mov.x = 0;
			mov.y = -1;
			mov.head = 'L';
		}
		if (h == 'R') {
			mov.x = 1;
			mov.y = 0;
			mov.head = 'D';
		}
		map[x][y] = 0;
	}
	return mov;
}

A ant(int x, int y, char h) {
	A mov;
	mov = move(x,y,h,map[x][y]);
	A newant;
	newant.x = x + mov.x;
	newant.y = y + mov.y;
	newant.head = mov.head;
	return newant;
}

int main() {
	int m,n;
	cin >> m >> n;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			cin >> map[i][j];
		}
	}
	A a;
	int k;
	cin >> a.x >> a.y >> a.head >> k;
	for (int i = 0; i < k; i++) {
		a = ant(a.x, a.y, a.head);
	} 
	cout << a.x << " " << a.y << endl;
	return 0;
}