Problem p03245 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;

// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b)                                                          \
  for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
  return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
  vll r(v.size());
  rep(i, v.size()) r[i] = v[i];
  return r;
}

inline void input(int &v) {
  v = 0;
  char c = 0;
  int p = 1;
  while (c < '0' || c > '9') {
    if (c == '-')
      p = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    v = (v << 3) + (v << 1) + c - '0';
    c = getchar();
  }
  v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
  o << "(" << v.first << ", " << v.second << ")";
  return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
  using s = int[];
  (void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
    -> basic_ostream<Ch, Tr> & {
  os << "(";
  print_tuple(os, t, gen_seq<sizeof...(Args)>());
  return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
  rep(i, v.size()) {
    rep(j, v[i].size()) o << v[i][j] << " ";
    o << endl;
  }
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
  o << '[';
  rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
  o << "]";
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
  o << '[';
  rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
  o << "]";
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it;
  o << "]";
  return o;
}
vector<int> range(const int x, const int y) {
  vector<int> v(y - x + 1);
  iota(v.begin(), v.end(), x);
  return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
  rep(j, o.size()) i >> o[j];
  return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.top();
    tmp.pop();
    o << x << " ";
  }
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.front();
    tmp.pop();
    o << x << " ";
  }
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.top();
    tmp.pop();
    o << x << " ";
  }
  return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
  unordered_map<T, ll> ret;
  for (auto &&x : vec)
    ret[x]++;
  return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
  ofstream ofs("./out.dot");
  ofs << "digraph graph_name {" << endl;
  set<P> memo;
  rep(i, g.size()) rep(j, g[i].size()) {
    if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
      continue;
    memo.insert(P(i, g[i][j]));
    ofs << "    " << i << " -> " << g[i][j]
        << (mode ? " [arrowhead = none]" : "") << endl;
  }
  ofs << "}" << endl;
  ofs.close();
  system(((string) "dot -T png out.dot >" + filename).c_str());
}
class ScopedTime {
public:
  ScopedTime(const std::string &msg = "") : msg_(msg) {
    start_ = std::chrono::system_clock::now();
  }
  void lap(const std::string &msg) {
    const auto duration_time = std::chrono::system_clock::now() - start_;
    const auto duration_ms =
        std::chrono::duration_cast<std::chrono::milliseconds>(duration_time);
    std::cerr << "[" << duration_ms.count() << " ms] " << msg << std::endl;
  }
  virtual ~ScopedTime() { this->lap(msg_); }

private:
  std::chrono::system_clock::time_point start_;
  std::string msg_;
};

size_t g_random_seed;
struct init_ {
  init_() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    srand(static_cast<unsigned int>(time(NULL)));
    g_random_seed = RAND_MAX / 2 + rand() / 2;
  }
} init__;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
  size_t operator()(argument_type const &x) const {
    size_t seed = g_random_seed;
    seed ^= hash<ll>{}(x.fi);
    seed ^= (hash<ll>{}(x.se) << 1);
    return seed;
  }
};
}; // namespace std

#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils

// void out(std::stringstream& ss, char c, int count) {
//     for (int i = 0; i < count; i++) {
//         ss << c;
//     }
// }
//
int N;
int main(void) {
  std::ios::sync_with_stdio(false);
  cin >> N;
  vector<ll> x(N), y(N);
  int odd_or_even = 0;
  for (int i = 0; i < N; i++) {
    cin >> x[i] >> y[i];
  }
  for (int i = 0; i < N; i++) {
    if (i == 0) {
      odd_or_even = (x[i] + y[i]) & 1;
    } else {
      if (odd_or_even != ((x[i] + y[i]) & 1)) {
        std::cout << -1 << std::endl;
        return -1;
      }
    }
  }
  std::stringstream ss;
  vector<ll> d;
  for (int i = 0; i < 31; i++) {
    d.push_back(1ll << i);
  }
  // もしx+yが奇数なら余分に1の長さの腕が必要
  if (odd_or_even == 0) {
    d.push_back(1);
  }

  std::sort(d.rbegin(), d.rend());
  std::cout << d.size() << std::endl;
  // 腕はreverse(1, 1, 2, 4, 8, 16...) とする
  for (auto &&r : d) {
    std::cout << r << " ";
  }
  std::cout << std::endl;

  for (int i = 0; i < N; i++) {
    // それぞれの目標位置について、
    // 原点からスタートして長い腕(原点側）から順番に
    ll xx = 0, yy = 0;
    int dx[] = {-1, 1, 0, 0};
    int dy[] = {0, 0, -1, 1};
    string dir = "LRDU";
    for (auto l : d) {
      // 目標位置に近づくような方向に腕を定める
      int q = 0;
      ll best = INF; // std::numeric_limits<ll>::max();
      for (int j = 0; j < 4; j++) {
        ll xxx = xx + l * dx[j];
        ll yyy = yy + l * dy[j];
        ll dd = std::abs(xxx - x[i]) + std::abs(yyy - y[i]);
        if (dd < best) {
          best = dd;
          q = j;
        }
      }
      std::cout << dir[q];
      xx += l * dx[q];
      yy += l * dy[q];
    }
    std::cout << std::endl;
  }

  return 0;
}


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

// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b)                                                          \
  for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
  return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
  vll r(v.size());
  rep(i, v.size()) r[i] = v[i];
  return r;
}

inline void input(int &v) {
  v = 0;
  char c = 0;
  int p = 1;
  while (c < '0' || c > '9') {
    if (c == '-')
      p = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    v = (v << 3) + (v << 1) + c - '0';
    c = getchar();
  }
  v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
  o << "(" << v.first << ", " << v.second << ")";
  return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
  using s = int[];
  (void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
    -> basic_ostream<Ch, Tr> & {
  os << "(";
  print_tuple(os, t, gen_seq<sizeof...(Args)>());
  return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
  rep(i, v.size()) {
    rep(j, v[i].size()) o << v[i][j] << " ";
    o << endl;
  }
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
  o << '[';
  rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
  o << "]";
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
  o << '[';
  rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
  o << "]";
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it;
  o << "]";
  return o;
}
vector<int> range(const int x, const int y) {
  vector<int> v(y - x + 1);
  iota(v.begin(), v.end(), x);
  return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
  rep(j, o.size()) i >> o[j];
  return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.top();
    tmp.pop();
    o << x << " ";
  }
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.front();
    tmp.pop();
    o << x << " ";
  }
  return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.top();
    tmp.pop();
    o << x << " ";
  }
  return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
  unordered_map<T, ll> ret;
  for (auto &&x : vec)
    ret[x]++;
  return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
  ofstream ofs("./out.dot");
  ofs << "digraph graph_name {" << endl;
  set<P> memo;
  rep(i, g.size()) rep(j, g[i].size()) {
    if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
      continue;
    memo.insert(P(i, g[i][j]));
    ofs << "    " << i << " -> " << g[i][j]
        << (mode ? " [arrowhead = none]" : "") << endl;
  }
  ofs << "}" << endl;
  ofs.close();
  system(((string) "dot -T png out.dot >" + filename).c_str());
}
class ScopedTime {
public:
  ScopedTime(const std::string &msg = "") : msg_(msg) {
    start_ = std::chrono::system_clock::now();
  }
  void lap(const std::string &msg) {
    const auto duration_time = std::chrono::system_clock::now() - start_;
    const auto duration_ms =
        std::chrono::duration_cast<std::chrono::milliseconds>(duration_time);
    std::cerr << "[" << duration_ms.count() << " ms] " << msg << std::endl;
  }
  virtual ~ScopedTime() { this->lap(msg_); }

private:
  std::chrono::system_clock::time_point start_;
  std::string msg_;
};

size_t g_random_seed;
struct init_ {
  init_() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    srand(static_cast<unsigned int>(time(NULL)));
    g_random_seed = RAND_MAX / 2 + rand() / 2;
  }
} init__;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
  size_t operator()(argument_type const &x) const {
    size_t seed = g_random_seed;
    seed ^= hash<ll>{}(x.fi);
    seed ^= (hash<ll>{}(x.se) << 1);
    return seed;
  }
};
}; // namespace std

#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils

// void out(std::stringstream& ss, char c, int count) {
//     for (int i = 0; i < count; i++) {
//         ss << c;
//     }
// }
//
int N;
int main(void) {
  std::ios::sync_with_stdio(false);
  cin >> N;
  vector<ll> x(N), y(N);
  int odd_or_even = 0;
  for (int i = 0; i < N; i++) {
    cin >> x[i] >> y[i];
  }
  for (int i = 0; i < N; i++) {
    if (i == 0) {
      odd_or_even = (x[i] + y[i]) & 1;
    } else {
      if (odd_or_even != ((x[i] + y[i]) & 1)) {
        std::cout << -1 << std::endl;
        return 0;
      }
    }
  }
  std::stringstream ss;
  vector<ll> d;
  for (int i = 0; i < 31; i++) {
    d.push_back(1ll << i);
  }
  // もしx+yが奇数なら余分に1の長さの腕が必要
  if (odd_or_even == 0) {
    d.push_back(1);
  }

  std::sort(d.rbegin(), d.rend());
  std::cout << d.size() << std::endl;
  // 腕はreverse(1, 1, 2, 4, 8, 16...) とする
  for (auto &&r : d) {
    std::cout << r << " ";
  }
  std::cout << std::endl;

  for (int i = 0; i < N; i++) {
    // それぞれの目標位置について、
    // 原点からスタートして長い腕(原点側）から順番に
    ll xx = 0, yy = 0;
    int dx[] = {-1, 1, 0, 0};
    int dy[] = {0, 0, -1, 1};
    string dir = "LRDU";
    for (auto l : d) {
      // 目標位置に近づくような方向に腕を定める
      int q = 0;
      ll best = INF; // std::numeric_limits<ll>::max();
      for (int j = 0; j < 4; j++) {
        ll xxx = xx + l * dx[j];
        ll yyy = yy + l * dy[j];
        ll dd = std::abs(xxx - x[i]) + std::abs(yyy - y[i]);
        if (dd < best) {
          best = dd;
          q = j;
        }
      }
      std::cout << dir[q];
      xx += l * dx[q];
      yy += l * dy[q];
    }
    std::cout << std::endl;
  }

  return 0;
}