QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#257399	#7751. Palindrome Path	ucup-team987^#	AC ✓	169ms	22236kb	C++20	14.8kb	2023-11-19 03:45:17	2023-11-19 03:45:18

Judging History

你现在查看的是最新测评结果

[2023-11-19 03:45:18]
评测

测评结果：AC
用时：169ms
内存：22236kb

查看

[2023-11-19 03:45:17]
提交

answer

/**
 * date   : 2023-11-19 04:44:56
 * author : Nyaan
 */

#define NDEBUG

using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

// utility

namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  template <typename S>
  P &operator*=(const S &r) {
    first *= r, second *= r;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
  template <typename S>
  P operator*(const S &r) const {
    return P(*this) *= r;
  }
  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

vector<int> mkiota(int n) {
  vector<int> ret(n);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
T mkrev(const T &v) {
  T w{v};
  reverse(begin(w), end(w));
  return w;
}

template <typename T>
bool nxp(vector<T> &v) {
  return next_permutation(begin(v), end(v));
}

// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
  vector<vector<T>> ret;
  vector<T> v;
  auto dfs = [&](auto rc, int i) -> void {
    if (i == (int)a.size()) {
      ret.push_back(v);
      return;
    }
    for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
  };
  dfs(dfs, 0);
  return ret;
}

// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
  T res = I;
  for (; n; f(a = a * a), n >>= 1) {
    if (n & 1) f(res = res * a);
  }
  return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I = T{1}) {
  return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}

template <typename T>
T Rev(const T &v) {
  T res = v;
  reverse(begin(res), end(res));
  return res;
}

template <typename T>
vector<T> Transpose(const vector<T> &v) {
  using U = typename T::value_type;
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      res[j][i] = v[i][j];
    }
  }
  return res;
}

template <typename T>
vector<T> Rotate(const vector<T> &v, int clockwise = true) {
  using U = typename T::value_type;
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      if (clockwise) {
        res[W - 1 - j][i] = v[i][j];
      } else {
        res[j][H - 1 - i] = v[i][j];
      }
    }
  }
  return res;
}

}  // namespace Nyaan


// bit operation

namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan


// inout

namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

istream &operator>>(istream &is, __int128_t &x) {
  string S;
  is >> S;
  x = 0;
  int flag = 0;
  for (auto &c : S) {
    if (c == '-') {
      flag = true;
      continue;
    }
    x *= 10;
    x += c - '0';
  }
  if (flag) x = -x;
  return is;
}

istream &operator>>(istream &is, __uint128_t &x) {
  string S;
  is >> S;
  x = 0;
  for (auto &c : S) {
    x *= 10;
    x += c - '0';
  }
  return is;
}

ostream &operator<<(ostream &os, __int128_t x) {
  if (x == 0) return os << 0;
  if (x < 0) os << '-', x = -x;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
  if (x == 0) return os << 0;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan


// debug


#ifdef NyaanDebug
#define trc(...) (void(0))
#else
#define trc(...) (void(0))
#endif

#ifdef NyaanLocal
#define trc2(...) (void(0))
#else
#define trc2(...) (void(0))
#endif


// macro

#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)


namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }


//


struct UnionFind {
  vector<int> data;
  UnionFind(int N) : data(N, -1) {}

  int find(int k) { return data[k] < 0 ? k : data[k] = find(data[k]); }

  int unite(int x, int y) {
    if ((x = find(x)) == (y = find(y))) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }

  // f ... merge function
  template<typename F>
  int unite(int x, int y,const F &f) {
    if ((x = find(x)) == (y = find(y))) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    f(x, y);
    return true;
  }

  int size(int k) { return -data[find(k)]; }

  int same(int x, int y) { return find(x) == find(y); }
};

/**
 * @brief Union Find(Disjoint Set Union)
 * @docs docs/data-structure/union-find.md
 */


using namespace Nyaan;

tuple<int, int, int, int> last[32][32][32][32];
char lastc[32][32][32][32];

void q() {
  ini(H, W);
  V<string> g(H);
  in(g);
  ini(sr, sc, tr, tc);
  --sr, --sc, --tr, --tc;

  // 非連結か？
  {
    int num = 0;
    UnionFind uf(H * W);
    rep(i, H) rep(j, W) {
      if (g[i][j] != '1') continue;
      num++;
      if (i and g[i - 1][j] == '1') {
        uf.unite(i * W + j, (i - 1) * W + j);
      }
      if (j and g[i][j - 1] == '1') {
        uf.unite(i * W + j, i * W + j - 1);
      }
    }
    if (uf.size(sr * W + sc) != num) die(-1);
  }

  auto canup = [&](int p, int q) { return p > 0 and g[p - 1][q] == '1'; };
  auto cando = [&](int p, int q) { return p + 1 < H and g[p + 1][q] == '1'; };
  auto canle = [&](int p, int q) { return q > 0 and g[p][q - 1] == '1'; };
  auto canri = [&](int p, int q) { return q + 1 < W and g[p][q + 1] == '1'; };

  // dp する
  rep(i, H) rep(j, W) rep(k, H) rep(l, W) last[i][j][k][l] =
      make_tuple(-1, -1, -1, -1);
  queue<vi> Q;
  auto add = [&](vi dst, vi cur, char c) {
    if (get<0>(last[dst[0]][dst[1]][dst[2]][dst[3]]) == -1) {
      trc(dst, cur, c);
      last[dst[0]][dst[1]][dst[2]][dst[3]] =
          make_tuple(cur[0], cur[1], cur[2], cur[3]);
      lastc[dst[0]][dst[1]][dst[2]][dst[3]] = c;
      Q.push(dst);
    }
  };
  add(vi{sr, sc, tr, tc}, vi{inf, -1, -1, -1}, '.');

  while (sz(Q)) {
    auto cur = Q.front();
    Q.pop();
    int i = cur[0];
    int j = cur[1];
    int k = cur[2];
    int l = cur[3];

    // U
    {
      int ni = canup(i, j) ? i - 1 : i;
      if (!canup(k, l)) add(vi{ni, j, k, l}, cur, 'U');
      if (cando(k, l)) add(vi{ni, j, k + 1, l}, cur, 'U');
    }
    // D
    {
      int ni = cando(i, j) ? i + 1 : i;
      if (!cando(k, l)) add(vi{ni, j, k, l}, cur, 'D');
      if (canup(k, l)) add(vi{ni, j, k - 1, l}, cur, 'D');
    }
    // L
    {
      int nj = canle(i, j) ? j - 1 : j;
      if (!canle(k, l)) add(vi{i, nj, k, l}, cur, 'L');
      if (canri(k, l)) add(vi{i, nj, k, l + 1}, cur, 'L');
    }
    // R
    {
      int nj = canri(i, j) ? j + 1 : j;
      if (!canri(k, l)) add(vi{i, nj, k, l}, cur, 'R');
      if (canle(k, l)) add(vi{i, nj, k, l - 1}, cur, 'R');
    }
  }

  // ランダムな経路を 1 個選ぶ
  // U = (sr, sc) とする
  string UW;
  {
    vvi vis(H, vi(W));
    auto dfs = [&](auto rc, int i, int j) -> void {
      trc(i, j);
      vis[i][j] = 1;
      if (canup(i, j) and !vis[i - 1][j]) {
        UW.push_back('U');
        rc(rc, i - 1, j);
        UW.push_back('D');
      }
      if (cando(i, j) and !vis[i + 1][j]) {
        UW.push_back('D');
        rc(rc, i + 1, j);
        UW.push_back('U');
      }
      if (canle(i, j) and !vis[i][j - 1]) {
        UW.push_back('L');
        rc(rc, i, j - 1);
        UW.push_back('R');
      }
      if (canri(i, j) and !vis[i][j + 1]) {
        UW.push_back('R');
        rc(rc, i, j + 1);
        UW.push_back('L');
      }
    };
    dfs(dfs, sr, sc);
  }
  trc(UW);

  string WV = UW;
  reverse(all(WV));
  int vr = sr, vc = sc;
  each(c, WV) {
    if (c == 'U' and canup(vr, vc)) vr--;
    if (c == 'D' and cando(vr, vc)) vr++;
    if (c == 'L' and canle(vr, vc)) vc--;
    if (c == 'R' and canri(vr, vc)) vc++;
  }
  trc(vr, vc);

  string VT;
  {
    int i = sr, j = sc;
    int k = vr, l = vc;
    while (i != sr or j != sc or k != tr or l != tc) {
      VT.push_back(lastc[i][j][k][l]);
      tie(i, j, k, l) = last[i][j][k][l];
    }
  }
  string SU = VT;
  reverse(all(SU));
  out(SU + UW + WV + VT);
}

void Nyaan::solve() {
  int t = 1;
  // in(t);
  while (t--) q();
}

源文件, 语言: C++20

这程序好像有点Bug，我给组数据试试？

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 5624kb

input:

output:

DRUDLUULDURD

result:

ok Valid Solution (Length = 12).

Test #2:

score: 0

Accepted

time: 0ms

memory: 3636kb

input:

output:

-1

result:

ok No Solution.

Test #3:

score: 0

Accepted

time: 1ms

memory: 5684kb

input:

1 1
1
1 1 1 1

output:

result:

ok Valid Solution (Length = 0).

Test #4:

score: 0

Accepted

time: 1ms

memory: 5740kb

input:

output:

DDDULLRUUULDDDDRRUUUURDDDDUUUULDDDDLLUUUURDDDDDDRUUUULLDDDDLUUUUDDDDRUUUURRDDDDLUUURLLUDDD

result:

ok Valid Solution (Length = 90).

Test #5:

score: 0

Accepted

time: 1ms

memory: 5732kb

input:

output:

RRRRLLDDDDLLUUUURLDDRLDDRRRRUUUUDDLRDDLLUUUURRUUUULLDDRLDDUUUURRRRDDLRDDLRUUUULLDDDDLLRRRR

result:

ok Valid Solution (Length = 90).

Test #6:

score: 0

Accepted

time: 0ms

memory: 7684kb

input:

output:

URDULLUURRLLDDRRDDLLRRUURRLLDDRRDDLLRRUULLUDRU

result:

ok Valid Solution (Length = 46).

Test #7:

score: 0

Accepted

time: 0ms

memory: 5704kb

input:

output:

ULRUDLUUDDRRDDURUUUDDDLULUULULDDDUUURUDDRRDDUULDURLU

result:

ok Valid Solution (Length = 52).

Test #8:

score: 0

Accepted

time: 1ms

memory: 5724kb

input:

output:

RUULLUUUDRRUDLLDDDURRLLLLRRUDDDLLDURRDUUULLUUR

result:

ok Valid Solution (Length = 46).

Test #9:

score: 0

Accepted

time: 1ms

memory: 5896kb

input:

output:

DDDUUULDDLDDLUUUDDDRRLUURRDRLULUULRRDDRRLUULULRDRRUULRRDDDUUULDDLDDLUUUDDD

result:

ok Valid Solution (Length = 74).

Test #10:

score: 0

Accepted

time: 1ms

memory: 5728kb

input:

output:

UUDLLURURDULDDDDRUDLULRUULDDLUURLULDURDDDDLUDRURULLDUU

result:

ok Valid Solution (Length = 54).

Test #11:

score: 0

Accepted

time: 1ms

memory: 5672kb

input:

output:

UUUDDLLRUULDDDRRUUURDDDRUUUDDDLUUULDDDLLUUURDDDDRUUULLDDDLUUULDDDUUURDDDRUUURRDDDLUURLLDDUUU

result:

ok Valid Solution (Length = 92).

Test #12:

score: 0

Accepted

time: 1ms

memory: 7712kb

input:

output:

UUUUDULLDDDDLLUUUURLDDRLDDRRRRUULRDDLLUUUURRDDRRUUUULLDDRLUURRRRDDLRDDLRUUUULLDDDDLLUDUUUU

result:

ok Valid Solution (Length = 90).

Test #13:

score: 0

Accepted

time: 1ms

memory: 5664kb

input:

output:

DRRRRLLLLDDRRRRDULLLLUURRRRLLLLRRRRUULLLLUDRRRRDDLLLLRRRRD

result:

ok Valid Solution (Length = 58).

Test #14:

score: 0

Accepted

time: 0ms

memory: 3832kb

input:

output:

-1

result:

ok No Solution.

Test #15:

score: 0

Accepted

time: 1ms

memory: 7796kb

input:

output:

DLLUULDDLUUUDDDRUURRRUDLLDDRRRRDDLLDURRRUURDDDUUULDDLUULLD

result:

ok Valid Solution (Length = 58).

Test #16:

score: 0

Accepted

time: 0ms

memory: 5696kb

input:

output:

RRDLDULLDDRRUURRLLDDRRLLLLUURRUULLLLRRDDLLRRUURRDDLLUDLDRR

result:

ok Valid Solution (Length = 58).

Test #17:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

output:

-1

result:

ok No Solution.

Test #18:

score: 0

Accepted

time: 0ms

memory: 5744kb

input:

output:

LLLRRDDDDLUUUULDDDDUUUURDDDDRRUUUURDDDDUUUULDDDDLUUUUUUUULDDDDLUUUUDDDDRUUUURRDDDDRUUUUDDDDLUUUULDDDDRRLLL

result:

ok Valid Solution (Length = 106).

Test #19:

score: 0

Accepted

time: 0ms

memory: 7812kb

input:

output:

DLLUUUURRDDDDLRRRUUUULRDDLRDDLLUULRUULLDDDDDDDDLLUURLUULLDDRLDDRLUUUURRRLDDDDRRUUUULLD

result:

ok Valid Solution (Length = 86).

Test #20:

score: 0

Accepted

time: 0ms

memory: 7924kb

input:

output:

ULLDDRRRRDULLLLUURRRRLLLLDDRRRRDDLLLLRRRRUURRRRLLLLDDRRRRDDLLLLRRRRUULLLLUDRRRRDDLLU

result:

ok Valid Solution (Length = 84).

Test #21:

score: 0

Accepted

time: 0ms

memory: 3580kb

input:

output:

-1

result:

ok No Solution.

Test #22:

score: 0

Accepted

time: 0ms

memory: 7996kb

input:

output:

DLUUUDRRUDDDDLULDURDRRURUUUDLRDDDULDLUUULLDDLLUUULDLUDDDRLDUUURURRDRUDLULDDDDURRDUUULD

result:

ok Valid Solution (Length = 86).

Test #23:

score: 0

Accepted

time: 1ms

memory: 7768kb

input:

output:

DLDDDLUUULDDDUUULRRDDDRRUDLUUURUURUUULDURRDDDRRLUUUDDDLUUULDDDLD

result:

ok Valid Solution (Length = 64).

Test #24:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

output:

-1

result:

ok No Solution.

Test #25:

score: 0

Accepted

time: 2ms

memory: 8012kb

input:

output:

UUUUUUUDDDDDDRRRRRLUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUUDDDDDDDDDRUUUUUUUUURDDDDDDDDDRUUUUUUUUURDDDDDDDDDRRUURUUUUUUUDDDDDDDDDUULDDLUUUUUUUUURDDDDDDDDDDDDRUUUUUUUUULDDLUUDDDDDDDDDUUUUUUURUURRDDDDDDDDDRUUUUUUUUURDDDDDDDDDRUUUUUUUUURDDDDDDDDDUUUUUUUUULDDDDDDDDDLUUUUUUUUULD...

result:

ok Valid Solution (Length = 354).

Test #26:

score: 0

Accepted

time: 2ms

memory: 10140kb

input:

output:

DRRLDDDDDDDDDULLUUUUUUUULLDDDDDDDDDURLUURLUURLUURLUURRRLDDRLDDRLDDRLDDDURRRLUURLUURLUURLUURRUULRUULRUULRUULRRRUDDDLRDDLRDDLRDDLRRRUULRUULRUULRUULRUDDDDDDDDDLLUUUUUUUULLUDDDDDDDDDLRRD

result:

ok Valid Solution (Length = 182).

Test #27:

score: 0

Accepted

time: 2ms

memory: 9948kb

input:

output:

LLLLLLLLRRRRLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLRRRRLLLLLLLL

result:

ok Valid Solution (Length = 240).

Test #28:

score: 0

Accepted

time: 0ms

memory: 3576kb

input:

output:

-1

result:

ok No Solution.

Test #29:

score: 0

Accepted

time: 0ms

memory: 7856kb

input:

output:

LUUUDDRUULDDLUULLUUUDRRRUDRRDDDDUUUULLLLLDDDDDDDDRUURUDDDRUURUDRLLDDRRLLLUULDDLUUUURLUURRDDRUURDDDDRUURDDRRUULRUUUULDDLUULLLRRDDLLRDURUURDDDURUURDDDDDDDDLLLLLUUUUDDDDRRDURRRDUUULLUULDDLUURDDUUUL

result:

ok Valid Solution (Length = 194).

Test #30:

score: 0

Accepted

time: 2ms

memory: 9988kb

input:

output:

DDLUULLLUUURUUULDURRDDDRUUURRDDDDDLUUUDDLDDDRUDDDLLLUUUUUDRDULDDLDDUURDDRRRRUUDRDURUUUUUUULUDDURDDDDLDURDDDLLDLUULUUURDRUUUUULLDDDLUUULDDDLDDDDDDLDDDLUUULDDDLLUUUUURDRUUULUULDLLDDDRUDLDDDDRUDDULUUUUUUURUDRDUURRRRDDRUUDDLDDLUDRDUUUUULLLDDDURDDDLDDUUULDDDDDRRUUURDDDRRUDLUUURUUULLLUULDD

result:

ok Valid Solution (Length = 284).

Test #31:

score: 0

Accepted

time: 0ms

memory: 3576kb

input:

output:

-1

result:

ok No Solution.

Test #32:

score: 0

Accepted

time: 0ms

memory: 9900kb

input:

output:

DDDDDRRRRRRRRRUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUUDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULD...

result:

ok Valid Solution (Length = 344).

Test #33:

score: 0

Accepted

time: 2ms

memory: 9924kb

input:

output:

LDRULLLLDUULLDDDDDDDDDULLUUUUUUUURLDDRLDDRLDDRLDDDURRRRUUUUUDLRRRUUUULRRRDDDDDDDDDULLUUUDLRRLDDDULRRRRLUURLUULRRLUULRRLUURLLLDDLRDDLLDDLRDDDULLUUUUUURLUURRDDDDRRUULRUUUUUULLUDDDRLDDLLDDRLDDLLLRUULRRLUULRRLUULRUULRRRRLUDDDLRRLDUUULLUDDDDDDDDDRRRLUUUURRRLDUUUUURRRRUDDDLRDDLRDDLRDDLRUUUUUUUULLUDDDDDDDD...

result:

ok Valid Solution (Length = 314).

Test #34:

score: 0

Accepted

time: 0ms

memory: 7988kb

input:

output:

RDRRRRRDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDRRRRRDR

result:

ok Valid Solution (Length = 244).

Test #35:

score: 0

Accepted

time: 0ms

memory: 3648kb

input:

output:

-1

result:

ok No Solution.

Test #36:

score: 0

Accepted

time: 1ms

memory: 5768kb

input:

output:

DDLLLRRLDLUUUUDRRRUDRRURDDDLUDDLULDURDRURRRDURUUUDLLUDRRDDLLLUUULDLLLLLDDDRURRURDDDLLLLLDLUUULLLDDRRDULLDUUURUDRRRURDRUDLULDDULDDDRURRDURRRDUUUULDLRRLLLDD

result:

ok Valid Solution (Length = 154).

Test #37:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

output:

-1

result:

ok No Solution.

Test #38:

score: 0

Accepted

time: 2ms

memory: 7908kb

input:

output:

DRRURRRRLLLUULDDDDDDDDRUUURUUUUUDRDDRUUUDDDDDDDDLUDLRRUUULRUULUULDDLRDDDULDDDLULUUUUUULUDDDDDDDDULLULUUURUUUDLRRLDDDRUDDULULDDDDDRLUURDRRUUUUUURDDDDDDRUUUUUUURDDDDRUUUUUUURDDDDDDRUUUUUURRDRUULRDDDDDLULUDDURDDDLRRLDUUURUUULULLUDDDDDDDDULUUUUUULULDDDLUDDDRLDDLUULUURLUUURRLDULDDDDDDDDUUURDDRDUUUUURUUUR...

result:

ok Valid Solution (Length = 322).

Test #39:

score: 0

Accepted

time: 3ms

memory: 9848kb

input:

output:

DDULLLLLLLLRRRRUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUUDDDDDDDDDRUUUUUUUUURDDDDDDDDDRRRUUUUUUUUURDDDDDDDDDRUUUUUUUUURDDDDDDDDDRUUUUUUUUUDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLLUUUUUUUUURDDDDDDDDDDDDDDDDRUUUUUUUUULLDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDUUUUUUUUURDDDDDDDD...

result:

ok Valid Solution (Length = 426).

Test #40:

score: 0

Accepted

time: 0ms

memory: 8036kb

input:

output:

UUUUUUUUUDRRURRDDDDDDDDDULLUUUUUURLDDRLDDRLDDDURRRRUUUUUUUULRRRDDDDDDDDDULRRRUUUUUUUULRRLDDLRRLDDLRRLDDLRRLDDDURLLLUULRUULRUULRUULLDDLRDDLRDDLRDDDULLUUUUUUUULLDDLLUUUUUUUULLUDDDRLDDRLDDRLDDLLUURLUURLUURLUULLLRUDDDLRRLDDLRRLDDLRRLDDLRRLUUUUUUUURRRLUDDDDDDDDDRRRLUUUUUUUURRRRUDDDLRDDLRDDLRUUUUUULLUDDDD...

result:

ok Valid Solution (Length = 320).

Test #41:

score: 0

Accepted

time: 2ms

memory: 9796kb

input:

output:

LLLLLRUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUURLLLLL

result:

ok Valid Solution (Length = 266).

Test #42:

score: 0

Accepted

time: 0ms

memory: 3628kb

input:

output:

-1

result:

ok No Solution.

Test #43:

score: 0

Accepted

time: 0ms

memory: 10208kb

input:

output:

DRRRRRRRRUUUUDDDDLLLUULLUULUUUUULDDDLUUUDDDDDDDDDRRRUDRLLLLUURUUDRDULDLUUUURUUURDRRURDDDDDLRRUURDDDDLUDRUUUURRLLLDDLUULUDLRRUURUDRRURDULDLLLULDLLDDDDRDDRRDDRRRRUUDDLUUUURLLRUUUULDDUURRRRDDRRDDRDDDDLLDLULLLDLUDRURRDURUURRLDULUULDDLLLRRUUUURDULDDDDRUURRLDDDDDRURRDRUUURUUUULDLUDRDUURUULLLLRDURRRDDDDDDD...

result:

ok Valid Solution (Length = 342).

Test #44:

score: 0

Accepted

time: 0ms

memory: 10036kb

input:

output:

LUULUURUULLDURRRDDDDRUDDRURUUULULDURDDURRDDDDDDDLUUUDLDDDLUULUDDDLUULLUUUUDDRLDDDDRLUURRDDRUURDDRRLUUURDDRUURRUDDDDLRUUULLUURLUURUURLDDRDULLULDDDLDLULUUUULDDLDDRDDDDRDDLDDLUUUULULDLDDDLULLUDRDDLRUURUULRUULLUUURLDDDDURRUURDDRUUULRRDDRUURDDRRUULRDDDDLRDDUUUULLUULDDDULUULDDDLDUUULDDDDDDDRRUDDRUDLULUUUR...

result:

ok Valid Solution (Length = 326).

Test #45:

score: 0

Accepted

time: 0ms

memory: 3560kb

input:

output:

-1

result:

ok No Solution.

Test #46:

score: 0

Accepted

time: 9ms

memory: 16444kb

input:

20 12
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
16 8 13 12

output:

DDDDDDDDDDDDUUUURRRRRRRRRRRLLLLUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDUUUUUUUUUUUUUUUUUUURDDDDDDDDDDDDDDDDDDDRUUUUUUUUUUUUUUUUUUURDDDDDDDDDDDDDDDDDDDRUUUUUUUUUUUUUUUUUUURDDDDDDDDDDDDDD...

result:

ok Valid Solution (Length = 1018).

Test #47:

score: 0

Accepted

time: 12ms

memory: 14792kb

input:

20 17
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
111111...

output:

UUUUUUULDLLLLLURLUUUUUULLDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUURLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDDURRRRUUUUUUUUUUUDLRRRUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUDLRRLDDLRRLDDLRRLDDLRRLDDDULRRRRRUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDULRRRUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDULRUULRUULRUUL...

result:

ok Valid Solution (Length = 1068).

Test #48:

score: 0

Accepted

time: 9ms

memory: 14224kb

input:

20 19
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
11111111111111...

output:

RRRRRRRRRRRDDUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDULLLLLLL...

result:

ok Valid Solution (Length = 822).

Test #49:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

20 16
0101001111110001
0000111101001011
0000111100011001
1101110100110100
1011011110001101
1101000110111111
0111010111100101
1101101111011001
1101010100000101
1111001000110010
0001011000101000
0101111010110110
0001101111000111
1010100010000110
0100100011011100
0100100101011111
0001000001001110
10011...

output:

-1

result:

ok No Solution.

Test #50:

score: 0

Accepted

time: 16ms

memory: 14712kb

input:

20 18
100101011111011110
111111111111111111
101111101010000001
111111111111111111
110010011011001010
111111111111111111
110110111110000010
111111111111111111
100001000001111000
111111111111111111
100010100111111000
111111111111111111
111100011010110111
111111111111111111
111101010111011110
111111111...

output:

URRRRRRRDRRRRLULDDDDDDLUUUULUUUUUULDDDDDDLDDLUUUUUULDDLDDLUULUULUULUUUUUULUDDDLUULLUDDDDDDDDDDDDDDDDDDDRUURUUUUUULDDDDUUUURRDDDDDDDDLUDRRRRUULUUUULRRLDDLRRRUDDDDDRRUUUUUUDDLRDDLRRRDDLRRRRUDRRRLLLLLLUURRLLLLDDLLUUUULLDDLRRDDLLLUUUUUUUURUULLLRRRDDRLLLDDDDDDLDDLUUUUUUUUUUUURUUUUDDRRDDLRUULLDDLUUUUUURRD...

result:

ok Valid Solution (Length = 1136).

Test #51:

score: 0

Accepted

time: 16ms

memory: 14944kb

input:

20 16
1110111111111111
1111111001111111
1111110111111011
1111110011111111
1111111111011111
1111110111101111
1111011111111111
1101111111111111
1011111111111001
0111111011111111
1110111111111111
1111111111111111
1111011011111111
0101110111111111
1110111101111110
1111111111111111
1111111111011111
11111...

output:

UUUUULLRRULLDLULDDDDDLUUUULULDDDDDDDLUUUUUUUDDDDDDDDURURUUUUDDDDRDDDLUDDDDLUUUDLDDUURDDDDDDDDDLUUUUUDDDDDRRUUUUUDRDDDDRUUUUUULUURUUUURUUUUUDDRRDDDDLUUDDDDDDLUUUUDDDDDDDDDDDRUUUUURURUUUUUUUUUUULRRUURDDDLDDDDDDDDDDDDDDDDLUUUULDDDDUUUURDDDDRRUURUUUUUUUUUUULUDDDDDDDDDDUUUUUUUUURRUUUUUULDDDDUUUURRDRURDDD...

result:

ok Valid Solution (Length = 1176).

Test #52:

score: 0

Accepted

time: 0ms

memory: 3516kb

input:

20 18
110111110101110101
101010111110101010
110101111101111101
111011111011101111
010111110111111101
111011111011111011
011111110111010111
101110101010111010
010111110101110111
101010101011101110
011101110111011111
101010111011111010
010101111111110101
101011101110111011
110101011101010101
101010101...

output:

-1

result:

ok No Solution.

Test #53:

score: 0

Accepted

time: 15ms

memory: 12456kb

input:

14 20
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
...

output:

DDDDDDDDDDDDDLLLLLLLRUUUUUUUUUUUUULDDDDDDDDDDDDDUUUUUUUUUUUUURRDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDDRUUUUUUUUUUUUURDDDDDDDDDDDDD...

result:

ok Valid Solution (Length = 1158).

Test #54:

score: 0

Accepted

time: 14ms

memory: 14508kb

input:

19 20
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
...

output:

RDDDDDDDDDLLLLLDDDDDDDDDDDDDDDDDDRRUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUULRRLDDLRRLDDLRRLDDLRRLDDLRRLDDLRRLDDLRRLDDLRRLDDLRRLDDRLLLUULRUULRUULRU...

result:

ok Valid Solution (Length = 1186).

Test #55:

score: 0

Accepted

time: 3ms

memory: 9884kb

input:

10 20
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
5 6 8 20

output:

DRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 488).

Test #56:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

18 20
11011110100011011100
01100010001011110000
11100110001011101110
10110111100011001111
10100011111011110011
00001010110000010010
01101101100110010001
10001000111110000100
11000011001000001001
10101011101010100110
01111011011010100001
00010110000101101011
10110101011011000011
00110010111011000100
...

output:

-1

result:

ok No Solution.

Test #57:

score: 0

Accepted

time: 21ms

memory: 15088kb

input:

20 20
10101101000110011011
11111111111111111111
10110101010011101111
11111111111111111111
11010000010101011110
11111111111111111111
10100110101011011011
11111111111111111111
10010101101010101001
11111111111111111111
11101001101101101010
11111111111111111111
11100110110111110111
11111111111111111111
...

output:

DDDULDDDDLDDLDDDDRRDUUUUUUUUUUUULLDDLUULLUUUULUDDDLDDLUUUUUDRLDDDDDDDDDDDDDDDDDDRRRRRRRRRUUUUUUUURUUUUUULUUUULLUDDDLLUUULDURDRLDDLRRRRLUURRRRURDDDLDDRDDDDLDDDDDDLUUDDRRUUUURUURUULUUUUUURDDRDDDDRUUUUUUULDURDRDDDDRUUUUURDDDUUULDDDDDDDLRRUUDDDDLDDDDDDDDDDLLLUULUUUUUUUDRDDDDRUURUULUUUDLRRLDDRDDDDDDLUDRU...

result:

ok Valid Solution (Length = 1320).

Test #58:

score: 0

Accepted

time: 24ms

memory: 14748kb

input:

18 20
11111111111110111111
01111111111011111111
01111111111110011111
11111111111101111111
11111011111110111111
11111111111110111110
11111111111111011111
11011111111111111110
11110111111111001111
10111111110110111111
11111011111111111111
11111111111011101111
11101111001111111111
11111111111111111111
...

output:

DDDDLLDDDLDDDDDDDDLDDURURRRUULUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDLUUUUUULUULUUUUUUUUULDDDDDDLUUUUUULRDDDLDDDDDDDDDDDDDDRUUUUUUURUULUDRDDDDDDDRUURUDDULDDLUUUURUDLULDDDDDDDRRRUDLLLLUUUUUUUUUUUUUURDDDRUUUUUURRDDDDDDDRUUDDDDUULUUUURUUUDDDLUUULDDDDDDDDDRDDRDDDDDDRRUUUDDRDRUUUURUUULUUUUUUUUUULDDDDDDDDDDDRLUUU...

result:

ok Valid Solution (Length = 1354).

Test #59:

score: 0

Accepted

time: 0ms

memory: 3580kb

input:

13 20
11011101111111110111
11111110111010111111
11111111111101011101
10111010101111111010
01011101111111010111
10101011101110101110
01111101010101011111
11111011111110101011
11110111111111011111
11111010101011101011
01111111110101011111
10111010101011111110
11111111110111011101
12 16 1 20

output:

-1

result:

ok No Solution.

Test #60:

score: 0

Accepted

time: 28ms

memory: 16648kb

input:

20 20
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
...

output:

UUUUUUUUUUUUUUUDDDDDDDDDDDRRRRRRRRRRRRRRRLLLLLLUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUULD...

result:

ok Valid Solution (Length = 1690).

Test #61:

score: 0

Accepted

time: 17ms

memory: 14720kb

input:

20 20
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
...

output:

UUUUUUUUUUULUUUUUULLDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDURLUURLUURLUURLUURLUURLUURLUURLUURLUURRRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDDURRRLUURLUURLUURLUURLUURLUURLUURLUURLUURRRLDDRLDDRLDDRLDDRL...

result:

ok Valid Solution (Length = 1218).

Test #62:

score: 0

Accepted

time: 7ms

memory: 16140kb

input:

20 20
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
...

output:

LLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUUDDRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLL...

result:

ok Valid Solution (Length = 1108).

Test #63:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

20 20
11110100001010101100
10110001101110101000
01011110111010110000
10111001001011011100
00110111011000010101
01001111110001010010
00101001010111010111
10110100100010001000
10101010001110000010
01111111010110101011
00100101001111000101
00110001001001111000
10101110010001000010
00000100010000110000
...

output:

-1

result:

ok No Solution.

Test #64:

score: 0

Accepted

time: 23ms

memory: 16600kb

input:

20 20
11010001010100101010
11111111111111111111
11000010111011001011
11111111111111111111
10010100111100111110
11111111111111111111
11101100001110000111
11111111111111111111
11010100111101000011
11111111111111111111
11010011111100110100
11111111111111111111
10001011110000111010
11111111111111111111
...

output:

DDDLDURDDDLDURDLUDDDDDLUULDDLLDDLUUUULUULUDDDDDLUUUULUDLDDLDDDDDDLLUULUULDDDDDDLUUUUUUUUUUURDDDRRDDRDDUULUURLLLUURRUDRRLLLLULDDDDDDDDDDDDDDDDDDDRUUUURDDRUURUUUULUDLRRRRUURDDDDLUDLRRRUUUUUULLRRRDDDDDDRRRRDDLLLLDDLDDLUULLUURRRUDLLLDDDDLLUDLRRRRLUULRRRDDRRRRRRRUUUURRDDDDLRRRUUUULRRDDDDUUUULDDLRDDLLUULR...

result:

ok Valid Solution (Length = 1226).

Test #65:

score: 0

Accepted

time: 27ms

memory: 16816kb

input:

20 20
11111111111101111111
11111111111111111101
11111110111110111111
11111011110111111111
11010010110111111011
11111111111111101111
11111111111111111111
11111111111111111001
11111111011110111111
11111111111111111101
11101011111111111111
11111110111111101111
11111111111111111101
10111111111111100111
...

output:

LLLLLLLLLLLLLLRRRDDDDDUUUUUUUUULDDDLUUULDDDDDDDDDDDDDDDDDDRUUURUUUUUUUUUULUDDDDDDDDUUUUUUURDDDDRRUUUURDDDDRUUUUUUUUULDDLUUDDDURUURRDRURDDDDDDDDDDDDDDRUUUUUUUUURUUUUULDDUURDRDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUDDDDDDDDDLDDDDLLUUULUUUULUURUUUUURUUUDLRDDDDUULDDDDRDDDDUUUULDLDLDDLUUUDLDDDDDDDDLUUUDDDLRRRRUU...

result:

ok Valid Solution (Length = 1486).

Test #66:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

20 20
11010111110101010101
10111010101111101010
11111101111101110111
10101011111010101110
11111111110101111101
10111111111010101111
11110101010111111101
10111110101011101111
01110111011101111101
10111011101010111010
11010111011111010111
11111011101011101111
01010111011111011111
11111010111110111011
...

output:

-1

result:

ok No Solution.

Test #67:

score: 0

Accepted

time: 105ms

memory: 21100kb

input:

30 25
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
11111111...

output:

DDDDDDDDDDDDDDDDDDDDDDDDDUUUUUUUUUUUUUUUUUUUUUUULLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDD...

result:

ok Valid Solution (Length = 3168).

Test #68:

score: 0

Accepted

time: 74ms

memory: 21148kb

input:

30 25
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
10101010...

output:

ULDDDDDRDLLLLLLLLLLUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURRRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDRLDDRL...

result:

ok Valid Solution (Length = 2314).

Test #69:

score: 0

Accepted

time: 25ms

memory: 19560kb

input:

30 25
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
0000000000000000000000001
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
0000000000000000000000001
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
00000000...

output:

LLLLLDDURRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLDDURRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLDDUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLL...

result:

ok Valid Solution (Length = 1782).

Test #70:

score: 0

Accepted

time: 0ms

memory: 3872kb

input:

30 30
011110110001111010011111110010
011101110110100110001101010100
100100100111010000000011100101
111110001011110110101000100000
100110011100000111100111100010
110011101000111000101110011101
011000001101110100001010011100
001101101010010100111111110011
100010111001110111010110100001
000101010010110...

output:

-1

result:

ok No Solution.

Test #71:

score: 0

Accepted

time: 113ms

memory: 21544kb

input:

30 30
101011111010110011011100010111
111111111111111111111111111111
101000010010011000101010010010
111111111111111111111111111111
101010011110010001011010010101
111111111111111111111111111111
111100010110101001000001000001
111111111111111111111111111111
111101000101101001001000100001
111111111111111...

output:

URDDDDDDDDDDDDDDDDDDDDRDLLLLLLLLLLLLLLLLLULDDLDULUUUULLLUUUUUUUUUUUUUUUUUUUDRRUDDDDDDDDDDDDDLRRUUUUUUUURUULRRRRUUULDLULDLRURDRURRDRRUDDDDDDDLUUUULDDLUDDDLLDDLDDRRDDLLRRRUUUULRRDDRUUUDRRUURUULRRUUUUULDLRURDRDDRRRDDDDDDDDLLDDLUUUUUUUURRLLDDLRRRLLDDLLUDDDLUDLRRRLUURRRRLLDDDDDDLLUULLDDLDDLLUUUDLLDDDDLUU...

result:

ok Valid Solution (Length = 2802).

Test #72:

score: 0

Accepted

time: 167ms

memory: 21500kb

input:

30 30
111111111111111101111111011011
111111100111011111111111101010
111111111111111111111111011111
111111111101111111110111111110
111111111111111011111111111111
111110111111111111111111011111
111111111111111111111111111011
111101111111011111111111111111
111111111111111111111111111111
101110111110111...

output:

URRRRRRRRRRRRRDDLDDDDUUUUUUUUUUUUUUUULULDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDLUUUULUUUULLLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUULUUUUUUUUUUUUUULUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUULUUUUUUUUUUUUUUUUUURDDDDDDDDUUUUUUUULDDDDDDDDDDRLDDRDDDDUUUULDDDDDDDDDDUUUURDDDDDDLDDDUUURD...

result:

ok Valid Solution (Length = 3408).

Test #73:

score: 0

Accepted

time: 0ms

memory: 3864kb

input:

30 30
110111011111110111011111110101
101110101010111010101011101010
011101111101011101011111010111
111110101110111111111011101110
010101110101011101010101111111
101111101011111111111110101011
111101110111010101011101010101
111011111010101010101010101111
011111011111110101011111111101
111010101111101...

output:

-1

result:

ok No Solution.

Test #74:

score: 0

Accepted

time: 61ms

memory: 16592kb

input:

21 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

DDDDDDDDDDDDDUUUUUUUUUURRRRLUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUULDDDDDDDDD...

result:

ok Valid Solution (Length = 2572).

Test #75:

score: 0

Accepted

time: 51ms

memory: 16676kb

input:

21 30
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101...

output:

LLLLULLLLLLLLLLLLLLLLLDRDDDDRRDLUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDRRUUUUUDLRRRUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDDLLUUUDLRRLDDLRRRRRUUUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUUUULRRRDDDDDDDDDDDDDDDDDDDDLRRRUUUUUUUUUUUUUUUUUU...

result:

ok Valid Solution (Length = 1978).

Test #76:

score: 0

Accepted

time: 18ms

memory: 16596kb

input:

21 30
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000...

output:

LLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRR...

result:

ok Valid Solution (Length = 1752).

Test #77:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

25 30
011010010110010101001110110111
000011111001111101110011010001
011011100010011000110100110000
001111001100100010111111101001
000101111100111001000000001111
001010110011101110101000010000
001010011001010000011001001001
011111010111110110101001110000
011001010011100010100101011000
100011000011110...

output:

-1

result:

ok No Solution.

Test #78:

score: 0

Accepted

time: 70ms

memory: 17920kb

input:

25 30
101100000100000111111100110011
111111111111111111111111111111
100111110101001111010001110011
111111111111111111111111111111
101101100110111111011110101110
111111111111111111111111111111
111001000110101100010101000110
111111111111111111111111111111
100000001011110010001101011010
111111111111111...

output:

URDRRUURRRRRRRRRRRRRRRRRRRRRRRRLUUUUURDDDUUULDLLLULDDDDDLDDDDDDLUULUUUUUULDDLUUUUULDLULDDDDDLUUUUUDLDDDDDDLDDDDLUUUUUUUULUULLUDDDDDDDLDDLLLDDLDDLUULDDLDDDDLUUUUUUUUUUUUUUUUUDRRURDDDDDLUULRDDDDLUUDDRRRRUUUUUULDDUURRDDDDRRLLUURUURLDDRLLUULDDDDLRDDRRLLLLLUURUUUUULDLLDDDDDDDDRRRRLLLLDDRLDDDDDDDDDDDDDRUU...

result:

ok Valid Solution (Length = 2280).

Test #79:

score: 0

Accepted

time: 111ms

memory: 19480kb

input:

25 30
111111101111111111111111111111
111111111111111101111111110111
111111111111101111111111111111
111111111111111101101111111111
011101111111111111111111101111
111011100111111110111110111111
111111110111111111111111111111
111111111111110111111111111111
111111111111111101111111111111
111111111111111...

output:

UULLDDDDDLLLLLLLLLLLLLRRRDDDDDDDDDDDDDDLDUUUUULDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUDDDDDDDDDDDDDDDDDDDRUUURUURUUUUUUUUUUUUULDDDDDDDDUUUUUUUURRURUUUUULDDDLUUUDDDDURUUURRDDDDDDDDDDDDDDDDDLUUUUUUUUUUUDLDDDDDDDDDDDDDDDDDLUUUUDDDLDURDRRUUUUUUDDRDRUUUUUUURUUUUUUULUDDDDDDUUUUURRUUUUUUULDDDDLUUUDDDRUUUURRDDDD...

result:

ok Valid Solution (Length = 2886).

Test #80:

score: 0

Accepted

time: 0ms

memory: 3840kb

input:

25 30
110101110101011111010101010111
101111101011111011111110101010
110111011101110111111101011101
101011111011101011111111111011
110111111101011111110111111111
111111111110101011111111101010
110101010101010101011111011101
101010111010101111111111101111
111101110111011101011111010111
101010101010111...

output:

-1

result:

ok No Solution.

Test #81:

score: 0

Accepted

time: 148ms

memory: 22236kb

input:

30 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

UUUUUUUUUUUUUUUUUUUUUUUUDDDDDDDDDDDDRRRRRRRRRRRRRRRRRRLLUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUUUUUUUUUULDDDDDDDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUUUUUUUUU...

result:

ok Valid Solution (Length = 3708).

Test #82:

score: 0

Accepted

time: 98ms

memory: 21668kb

input:

30 30
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101...

output:

UUUUUUUUUUUUUUUUUUUDRRRRRRRRRRDUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDULLUUUUUUUUUUUUUUUUUUUUUUUUUUUULLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUURLUUR...

result:

ok Valid Solution (Length = 2758).

Test #83:

score: 0

Accepted

time: 37ms

memory: 20444kb

input:

30 30
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000...

output:

RRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 2666).

Test #84:

score: 0

Accepted

time: 0ms

memory: 3564kb

input:

30 30
010110110101101010000010000110
101110000111000001001111100101
010100011111100110100001111101
101101100010111011011010001010
100101010100001011101100101100
101001111001111101101100001110
000111101010011110100001110100
111111001101000001011110000111
010000100010000100000011101000
100001010111010...

output:

-1

result:

ok No Solution.

Test #85:

score: 0

Accepted

time: 110ms

memory: 21656kb

input:

30 30
100110101011111011001000111100
111111111111111111111111111111
101001000111011110000110011110
111111111111111111111111111111
111001111110100011111000000010
111111111111111111111111111111
100111001001100000100010001101
111111111111111111111111111111
110001101000111011111010110110
111111111111111...

output:

DRLDDLLDURRRRRRURDDDDDDDLDRRRRRRDDRDDDDDDRDDLLUULDDLLDDLUUUUUUUULLUULDDDDLUULLUULUUUUUUUUUUUULULDLDDDDLUULUUUDRLDDDDDDDDDDDDDDDDDDDDDDDDDDDDRRRRUULUUUULUUUULRRDDRDDRRUULUULUULLLUURUUUUUULUURRUURDDUULDDLLDDRRDDDDDDRUUDDRDDRDDRDDRRUULRRRUULRDDLLDDDDDDLUULRDDDDLUULDDDDLUUUULRDDDDRRUDRRRUULRRRUUULUUULDD...

result:

ok Valid Solution (Length = 2788).

Test #86:

score: 0

Accepted

time: 169ms

memory: 22192kb

input:

30 30
111101111111111111111011111111
100111111111111111111111011111
111111011111111111011111111110
101111111101111111111111111111
111111111111111111111111111111
111111101111011111111110111111
111011111111111111111111111111
111111111111111111111101111111
111111111111111111111111111111
011111100111111...

output:

UUUURULLLLLLLLLLLLDLUUDDDDDDDLUUUUUUUUUURUUUULUUUUUUUUUUUUUUULDDDDDDDDDDLUUUULUUUUUULDDLUULDDDDDDDDLUULUUULUUURDRUDDDDUUULULDLDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUUUUULUUUUULLUURRRDDDDDUUUUULLLDDDDDDDDRUUUUDDDDDDDDDDDDDDDDDDDDDDDLUUUUUUUUUUDDDDDDDDDDDDRRUUUUUUUUUUUUUUUUUUUUUDDDDDDDDDDDDDDDRDDDDDDRUUUUUURD...

result:

ok Valid Solution (Length = 3404).

Test #87:

score: 0

Accepted

time: 0ms

memory: 3864kb

input:

30 30
011111010101111111011101111101
111011101011111110111111101011
111111010101011101111101110101
111110101011101110111111101110
010111011101110101110101111101
101111101011101110101010111111
110101010101010111011101010101
101110101111101110101110111111
110111011101010111010111110101
101011111110111...

output:

-1

result:

ok No Solution.

Test #88:

score: 0

Accepted

time: 156ms

memory: 20896kb

input:

30 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

UUUUUUUUUUUUUUUUUUUUUUUUUUUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDDDDDDDDDDDDDDDDDDDDDDDDDDDDRUUUUUUUUUUUUUUUUUUUUUUUUUUUUURDDDDDDDDDDDDDDDDDDDDDDDDDDDDDRUUUUUUUUUUUUUUUUUUUUUUUUUUUUURDDDDDDDDDDDDDDDDDDDDDDDDDDDDDRUUUUUUUUUUUUUUUUUUUUUUUUUUUUURDDDDDDDDDDDDDDDDDDDDDDDDDDDDDRUUUUUUUUUUUUUUUUUUUUUUUUUUUUURDDD...

result:

ok Valid Solution (Length = 3710).

Extra Test:

score: 0

Extra Test Passed