Submission #5312468

---

Source Code Expand

#include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define eps LDBL_EPSILON
#define moder 1000000007
#define int long long
#define ll long long
#define double long double
#define INF LLONG_MAX/3
#define P pair<int,int>
#define prique priority_queue
using namespace std;
int k, x, y;
string s;
set<P> st;
signed main() {
	cin >> k >> s;
	st.insert(make_pair(0, 0));
	rep(i, k) {
		while (true) {
			if (s[i] == 'L')x--;
			if (s[i] == 'R')x++;
			if (s[i] == 'U')y++;
			if (s[i] == 'D')y--;
			if (st.find(make_pair(x, y)) == st.end()) {
				st.insert(make_pair(x, y));
				break;
			}
		}
	}
	cout << x << " " << y << endl;
	return 0;
}

Submission Info

Judge Result