Submission #1604817

---

Source Code Expand

#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

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

int main(){
#ifdef LOCAL_TEST
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int k;
    string s;
    cin >> k >> s;
    pii now = make_pair(0, 0);
    map<char, int> dir;
    dir['D'] = 0;
    dir['L'] = 1;
    dir['U'] = 2;
    dir['R'] = 3;
    map<pii, array<pii, 4>> mp;
    array<pii, 4> ar;
    rep(i, 4) ar[i] = make_pair(dx[i], dy[i]);
    mp[now] = ar;

    // cerr << endl;
    rep(i, k) {
        auto& tmp = mp[now];
        auto nxt = tmp[dir[s[i]]];
        // cerr << nxt.fi << " " << nxt.se << endl;
        array<pii, 4> nxtAr;
        rep(j, 4) {
            int nx = nxt.fi + dx[j], ny = nxt.se + dy[j];
            if(mp.count(make_pair(nx, ny))) {
                nxtAr[j] = mp[make_pair(nx, ny)][j];
            }
            else {
                nxtAr[j] = make_pair(nx, ny);
            }
        }
        mp[nxt] = nxtAr;
        tmp[dir[s[i]]] = nxtAr[dir[s[i]]];
        now = nxt;
    }
    cout << now.fi << " " << now.se << endl;
    return 0;
}

Submission Info

Judge Result