Problem p03054 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

namespace {
#define DUMPOUT cerr
#ifndef DEBUG_
#define dump(...)
#else
#define dump(...)                                                              \
  DUMPOUT << "  ";                                                             \
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \
          << endl;                                                             \
  DUMPOUT << "    ";                                                           \
  dump_func(__VA_ARGS__)
#endif
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i)
    os << *i << (i == end(v) - 1 ? "" : " ");
  return os;
}
template <class T> void out2Dvector(vector<T> v) {
  for (const auto &vv : v)
    cout << vv << endl;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i)
    is >> *i;
  return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << "(" << itr->first << ", " << itr->second << ")";
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
} // namespace

namespace {
using ull = unsigned long long;
using ll = long long;
#define endl "\n"

#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define even(x) (x) % 2 == 0
#define odd(x) (x) % 2 != 0
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define inp(t, x)                                                              \
  t x;                                                                         \
  cin >> x;
#define ithBit(n, i) ((n) >> (i)&1)
#define INIT()                                                                 \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(0);                                                     \
  cout << fixed << setprecision(20)

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)

#define M_PI 3.14159265358979323846
ll qp(ll a, ll b, int mo) {
  ll ans = 1;
  do {
    if (b & 1)
      ans = 1ll * ans * a % mo;
    a = 1ll * a * a % mo;
  } while (b >>= 1);
  return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
  ll temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};

template <typename F>
class
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
    [[nodiscard]]
#elif defined(__GNUC__) && __GNUC_PREREQ(3, 4)
    __attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
    FixPoint : F {
public:
  explicit constexpr FixPoint(F &&f) noexcept : F(std::forward<F>(f)) {}

  template <typename... Args>
  constexpr decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  } // namespace
};  // class FixPoint
template <typename F>
static inline constexpr decltype(auto) makeFixPoint(F &&f) noexcept {
  return FixPoint<F>{std::forward<F>(f)};
}

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
  return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
  u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
  for (auto &e : u)
    fill_v<T>(e, v...);
}

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
  return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}

ll i_query(set<int> x, set<int> y) {
  cout << x.size() << " " << y.size() << " ";
  for (const auto &e : x)
    cout << e << " ";
  for (const auto &e : y)
    cout << e << " ";
  cout << endl;
  fflush(stdout);
  ll ret;
  cin >> ret;
  return ret;
}

void i_answer(ll ans, ll d) {
  cout << "-1 " << ans << endl;
  fflush(stdout);
}
} // namespace

/*
    lambda recursion
    auto func = makeFixPoint([]() -> int {});
    int ret = func();

    tuple binding
    auto [x, y] = make_tuple(0, 0);
    for pair
    auto [a, b] = pair<int, int>({v1, v2});

    bitset<N> bs(ini_val); // N must be constant
    bs.reset(); // reset all
*/

int main(void) {
  INIT(); // comment out for Interective Program

  inp(ll, H);
  inp(ll, W);
  inp(ll, N);
  int sy, sx;
  cin >> sy >> sx;
  string s, t;
  cin >> s >> t;

  map<pair<bool, tuple<int, int, int>>, bool> dp;

  // turn == 1 : takahashi's turn
  auto rec = makeFixPoint([&](auto rec, int idx, bool turn, int cx, int cy) {
    pair<bool, tuple<int, int, int>> key = {turn, make_tuple(idx, cx, cy)};
    if (dp.count(key))
      return dp[key];
    if (idx >= N)
      return dp[key] = true;
    if (not rangeCheck2D(cx, cy, W, H))
      return dp[key] = false;
    int nidx = idx;
    if (not turn)
      nidx++;
    bool surv = rec(nidx, not turn, cx, cy);
    if (turn and not surv)
      return dp[key] = false;
    if (not turn and surv)
      return dp[key] = true;
    int nx = cx, ny = cy;
    char c = (turn) ? s[idx] : t[idx];
    if (c == 'L')
      ny += 0, nx += -1;
    if (c == 'R')
      ny += 0, nx += 1;
    if (c == 'U')
      ny += -1, nx += 0;
    if (c == 'D')
      ny += 1, nx += 0;
    bool s2 = rec(nidx, not turn, nx, ny);
    if (turn)
      surv &= s2;
    else
      surv |= s2;
    return dp[key] = surv;
  });

  if (rec(0, true, sx - 1, sy - 1))
    cout << "YES" << endl;
  else
    cout << "NO" << endl;

  return 0;
}
//*/


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

namespace {
#define DUMPOUT cerr
#ifndef DEBUG_
#define dump(...)
#else
#define dump(...)                                                              \
  DUMPOUT << "  ";                                                             \
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \
          << endl;                                                             \
  DUMPOUT << "    ";                                                           \
  dump_func(__VA_ARGS__)
#endif
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i)
    os << *i << (i == end(v) - 1 ? "" : " ");
  return os;
}
template <class T> void out2Dvector(vector<T> v) {
  for (const auto &vv : v)
    cout << vv << endl;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i)
    is >> *i;
  return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << "(" << itr->first << ", " << itr->second << ")";
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
} // namespace

namespace {
using ull = unsigned long long;
using ll = long long;
#define endl "\n"

#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define even(x) (x) % 2 == 0
#define odd(x) (x) % 2 != 0
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define inp(t, x)                                                              \
  t x;                                                                         \
  cin >> x;
#define ithBit(n, i) ((n) >> (i)&1)
#define INIT()                                                                 \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(0);                                                     \
  cout << fixed << setprecision(20)

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)

#define M_PI 3.14159265358979323846
ll qp(ll a, ll b, int mo) {
  ll ans = 1;
  do {
    if (b & 1)
      ans = 1ll * ans * a % mo;
    a = 1ll * a * a % mo;
  } while (b >>= 1);
  return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
  ll temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};

template <typename F>
class
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
    [[nodiscard]]
#elif defined(__GNUC__) && __GNUC_PREREQ(3, 4)
    __attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
    FixPoint : F {
public:
  explicit constexpr FixPoint(F &&f) noexcept : F(std::forward<F>(f)) {}

  template <typename... Args>
  constexpr decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  } // namespace
};  // class FixPoint
template <typename F>
static inline constexpr decltype(auto) makeFixPoint(F &&f) noexcept {
  return FixPoint<F>{std::forward<F>(f)};
}

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
  return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
  u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
  for (auto &e : u)
    fill_v<T>(e, v...);
}

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
  return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}

ll i_query(set<int> x, set<int> y) {
  cout << x.size() << " " << y.size() << " ";
  for (const auto &e : x)
    cout << e << " ";
  for (const auto &e : y)
    cout << e << " ";
  cout << endl;
  fflush(stdout);
  ll ret;
  cin >> ret;
  return ret;
}

void i_answer(ll ans, ll d) {
  cout << "-1 " << ans << endl;
  fflush(stdout);
}
} // namespace

/*
    lambda recursion
    auto func = makeFixPoint([]() -> int {});
    int ret = func();

    tuple binding
    auto [x, y] = make_tuple(0, 0);
    for pair
    auto [a, b] = pair<int, int>({v1, v2});

    bitset<N> bs(ini_val); // N must be constant
    bs.reset(); // reset all
*/

int main(void) {
  INIT(); // comment out for Interective Program

  inp(ll, H);
  inp(ll, W);
  inp(ll, N);
  int sy, sx;
  cin >> sy >> sx;
  string s, t;
  cin >> s >> t;

  // left
  int cx = sx, cy = sy;
  REP(i, N) {
    if (s[i] == 'L')
      cx--;
    if (cx < 1)
      goto NONO;
    if (t[i] == 'R')
      cx++;
    if (cx > W)
      cx = W;
  }

  // right
  cx = sx, cy = sy;
  REP(i, N) {
    if (s[i] == 'R')
      cx++;
    if (cx > W)
      goto NONO;
    if (t[i] == 'L')
      cx--;
    if (cx < 1)
      cx = 1;
  }

  // up
  cx = sx, cy = sy;
  REP(i, N) {
    if (s[i] == 'U')
      cy--;
    if (cy < 1)
      goto NONO;
    if (t[i] == 'D')
      cy++;
    if (cy > H)
      cy = H;
  }

  // right
  cx = sx, cy = sy;
  REP(i, N) {
    if (s[i] == 'D')
      cy++;
    if (cy > H)
      goto NONO;
    if (t[i] == 'U')
      cy--;
    if (cy < 1)
      cy = 1;
  }

  cout << "YES" << endl;
  return 0;
NONO:
  cout << "NO" << endl;

  return 0;
}
//*/