提出 #62337833

---

ソースコード 拡げる

#line 1 "main.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <utility>

// check below tricky optimization
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunknown-pragmas"

//*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
//*/

#pragma GCC diagnostic pop

/* template start */

#line 2 "/home/imperi/cp-library/lib/utility/debug.hpp"

#line 4 "/home/imperi/cp-library/lib/utility/debug.hpp"
#include <vector>

#ifdef LOCAL
#define debug(...)                                                             \
  std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:",          \
      debug_out(__VA_ARGS__)
#define debug_assert(e) assert(e)
#else
#define debug(...)
#define debug_assert(e)
#endif

inline void debug_out() { std::cerr << std::endl; }

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
  std::cerr << " " << h;
  if (sizeof...(t) > 0)
    std::cerr << " :";
  debug_out(t...);
}
#line 2 "/home/imperi/cp-library/lib/utility/template.hpp"

#line 4 "/home/imperi/cp-library/lib/utility/template.hpp"

#line 2 "/home/imperi/cp-library/lib/utility/type_alias.hpp"

#include <cstdint>

using i64 = std::int64_t;
using i32 = std::int32_t;
using i16 = std::int16_t;
using i8 = std::int8_t;

using u64 = std::uint64_t;
using u32 = std::uint32_t;
using u16 = std::uint16_t;
using u8 = std::uint8_t;

using usize = std::size_t;
using isize = std::ptrdiff_t;

constexpr i64 operator"" _i64(unsigned long long num) { return i64(num); }
constexpr i32 operator"" _i32(unsigned long long num) { return i32(num); }
constexpr i16 operator"" _i16(unsigned long long num) { return i16(num); }
constexpr i8 operator"" _i8(unsigned long long num) { return i8(num); }

constexpr u64 operator"" _u64(unsigned long long num) { return u64(num); }
constexpr u32 operator"" _u32(unsigned long long num) { return u32(num); }
constexpr u16 operator"" _u16(unsigned long long num) { return u16(num); }
constexpr u8 operator"" _u8(unsigned long long num) { return u8(num); }
#line 6 "/home/imperi/cp-library/lib/utility/template.hpp"

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename Num, typename Func = std::multiplies<Num>>
constexpr Num mypow(Num a, u64 b, Num id = 1, Func mul = Func()) {
  if (b == 0) return id;
  Num x = id;
  while (b > 0) {
    if (b & 1) x = mul(x, a);
    a = mul(a, a);
    b >>= 1;
  }
  return x;
}
#line 35 "main.cpp"

#line 2 "/home/imperi/cp-library/lib/heuristic/template.hpp"

#line 5 "/home/imperi/cp-library/lib/heuristic/template.hpp"
#include <chrono>
#line 7 "/home/imperi/cp-library/lib/heuristic/template.hpp"
#include <limits>
#line 9 "/home/imperi/cp-library/lib/heuristic/template.hpp"

// https://github.com/niuez/niuristic/blob/main/utility/xorshift.hpp
class Xor64 {
public:
  using state_type = std::uint64_t;
  using result_type = std::uint64_t;
  constexpr Xor64(state_type seed = 88675123) : a(seed) {}
  constexpr void seed(state_type seed = 88675123) { a = seed; }
  constexpr result_type operator()() {
    a ^= a << 7;
    a ^= a >> 9;
    return a;
  }

  //[l,r)
  constexpr result_type int_dist(int l, int r) {
    assert(l < r);
    return l + ((*this)() % (r - l));
  }

  //[0,1]
  constexpr long double prob_dist() {
    return (long double)((*this)()) / std::numeric_limits<state_type>::max();
  }

  // choice index with prob
  //  ex) prob = {4,6}; => return 0 : 40% , 1 : 60%
  size_t choice_with_prob(std::vector<int> prob) {
    size_t n = prob.size();
    for (size_t i = 1; i < n; i++)
      prob[i] += prob[i - 1];
    int max = prob.back();
    int r = int_dist(0, max);
    return std::upper_bound(prob.begin(), prob.end(), r) - prob.begin();
  }

  void discard(unsigned long long z) {
    while (z-- > 0) {
      (*this)();
    }
  }

private:
  state_type a;
  static constexpr result_type min() {
    return std::numeric_limits<result_type>::min();
  }
  static constexpr result_type max() {
    return std::numeric_limits<result_type>::max();
  }
};

class Timer {
public:
  Timer() : start(std::chrono::system_clock::now()) {}

  double now_sec() const {
    auto now = std::chrono::system_clock::now();
    return static_cast<double>(
               std::chrono::duration_cast<std::chrono::nanoseconds>(now - start)
                   .count()) /
           1000000000;
  }

private:
  std::chrono::system_clock::time_point start;
};
#line 37 "main.cpp"

#define rep_ty(ty, i, a, b) for (ty i = (a); i < (b); i++)
#define rep(i, a, b) rep_ty(i64, i, a, b)

/* template end */

// hyper parameter

enum KOMA {
  NONE,
  ONI,
  FUKU,
};

constexpr int N = 20;
int board[N][N];

using P = std::pair<int, int>;
int calc_exit_dist(P p) {
  return std::min({p.first + 1, N - p.first, p.second + 1, N - p.second});
}

void input() {
  int n;
  std::cin >> n;

  rep(i, 0, N) {
    std::string s;
    std::cin >> s;

    rep(j, 0, N) {
      if (s[j] == 'x')
        board[i][j] = ONI;
      else if (s[j] == 'o')
        board[i][j] = FUKU;
      else
        board[i][j] = NONE;
    }
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  input();

  rep(i, 0, N) {
    rep(j, 0, N) {
      if (board[i][j] == ONI) {
        {
          bool flag = true;
          rep(k, 0, i) {
            if (board[k][j] == FUKU)
              flag = false;
          }

          if (flag) {
            rep(k, 0, i + 1) { std::cout << "U " << j << "\n"; }
            rep(k, 0, i + 1) { std::cout << "D " << j << "\n"; }
            continue;
          }
        }
        {
          bool flag = true;
          rep(k, i + 1, N) {
            if (board[k][j] == FUKU)
              flag = false;
          }

          if (flag) {
            rep(k, i, N) { std::cout << "D " << j << "\n"; }
            rep(k, i, N) { std::cout << "U " << j << "\n"; }
            continue;
          }
        }
        {
          bool flag = true;
          rep(k, 0, j) {
            if (board[i][k] == FUKU)
              flag = false;
          }

          if (flag) {
            rep(k, 0, j + 1) { std::cout << "L " << i << "\n"; }
            rep(k, 0, j + 1) { std::cout << "R " << i << "\n"; }
            continue;
          }
        }
        {
          bool flag = true;
          rep(k, j + 1, N) {
            if (board[i][k] == FUKU)
              flag = false;
          }

          if (flag) {
            rep(k, j, N) { std::cout << "R " << i << "\n"; }
            rep(k, j, N) { std::cout << "L " << i << "\n"; }
            continue;
          }
        }
      }
    }
  }

  return 0;
}

提出情報

ジャッジ結果