Submission #408052

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <memory>
#include <map>
using namespace std;

class point{
public:
	point(long long x, long long y){
		this->x = x;
		this->y = y;
	}
	point(){
		this->x = 0;
		this->y = 0;
	}
	long long x;
	long long y;
	point add(point& x){
		return point(this->x + x.x, this->y + x.y);
	}
	point sub(point& x){
		return point(this->x - x.x, this->y - x.y);
	}
};

int main(){
	long long K;
	cin >> K;
	map<long long, map<long long, map<char, point>>> mymap;
	map<long long, map<long long, bool>> exist;
	map<char, point> direction;
	direction['L'] = point(-1, 0);
	direction['R'] = point(1, 0);
	direction['D'] = point(0, -1);
	direction['U'] = point(0, 1);
	point pre = point(0, 0);
	for ( long long i = 0; i < K; i++ )
	{
		exist[pre.x][pre.y] = true;

		char c;
		cin >> c;
		point now;
		now = pre.add(mymap[pre.x][pre.y][c]).add(direction[c]);
		{
			point D = now.add(direction['D']);
			point DD = ( exist[D.x][D.y] ? D.add(mymap[D.x][D.y]['D']) : now );
			point U = now.add(direction['U']);
			point UU = ( exist[U.x][U.y] ? U.add(mymap[U.x][U.y]['U']) : now );
			mymap[DD.x][DD.y]['U'] = UU.sub(DD);
			mymap[UU.x][UU.y]['D'] = DD.sub(UU);
		}
		{
			point L = now.add(direction['L']);
			point LL = ( exist[L.x][L.y] ? L.add(mymap[L.x][L.y]['L']) : now );
			point R = now.add(direction['R']);
			point RR = ( exist[R.x][R.y] ? R.add(mymap[R.x][R.y]['R']) : now );
			mymap[LL.x][LL.y]['R'] = RR.sub(LL);
			mymap[RR.x][RR.y]['L'] = LL.sub(RR);
		}
		pre = now;
	}
	cout << pre.x << " " << pre.y << endl;
	return 0;
}

Submission Info

Judge Result