Submission #1793678

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(ll i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;


int K;
string s;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};


int main(void) {
	
	cin >> K;
	cin >> s;

	set<pair<int, int>> st;
	int y = 0, x = 0;
	st.insert(mp(y, x));

	
	rep(i, K) {
		int d = 0;
		if(s[i] == 'U') d = 0;
		else if(s[i] == 'R') d = 1;
		else if(s[i] == 'D') d = 2;
		else d = 3;
		while(1) {
			int ny = y + dy[d], nx = x + dx[d];
			if(st.count(mp(ny, nx)) == 0) {
				st.insert(mp(ny, nx));
				y = ny, x = nx;
				break;
			}else{
				y = ny, x = nx;
			}
		}
	}
	printf("%d %d\n", x, y);
	
	return 0;
}

Submission Info

Judge Result