[atcoder/335] C - Loong Tracking

https://www.acmicpc.net/problem/3190

3190번: 뱀

위 문제와 거의 동일하다.

 

#include <iostream>
#include <deque>
using namespace std;
typedef pair<int, int> pii;
deque<pii> dq;
int N, Q;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	cin >> N >> Q;
	for (int i = 1; i <= N; ++i) dq.push_back({ i, 0 });
	while(Q--){
		int q;	cin >> q;
		if (q == 1) {
			char d; cin >> d;
			auto head = dq.front();
			if (d == 'U') head.second += 1;
			if (d == 'D') head.second -= 1;
			if (d == 'L') head.first -= 1;
			if (d == 'R') head.first += 1;
			dq.push_front(head);
			dq.pop_back();
		}
		else {
			int p; cin >> p;
			cout << dq[p - 1].first << " " << dq[p - 1].second << "\n";
		}
	}

	return 0;
}