結果
| 問題 |
No.2411 Reverse Directions
|
| コンテスト | |
| ユーザー |
 poyon
|
| 提出日時 | 2023-08-11 22:27:59 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 28 ms / 2,000 ms |
| コード長 | 14,401 bytes |
| コンパイル時間 | 2,569 ms |
| コンパイル使用メモリ | 228,836 KB |
| 最終ジャッジ日時 | 2025-02-16 01:41:31 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 29 |
ソースコード
// clang-format off
#ifdef _LOCAL
#include <pch.hpp>
#else
#include <bits/stdc++.h>
#define cerr if (false) cerr
#define debug_bar
#define debug(...)
#define debug2(vv)
#define debug3(vvv)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VC = vector<char>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define FORE(e,c) for (auto&& e : c)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define COUNT(c,v) count(ALL(c),(v))
#define len(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) ((ll)__builtin_popcountll(b))
#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))
#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))
#define UQ(c) do { SORT(c); (c).erase(unique(ALL(c)), (c).end()); (c).shrink_to_fit(); } while (0)
#define END(...) do { print(__VA_ARGS__); exit(0); } while (0)
constexpr ld EPS = 1e-10;
constexpr ld PI = acosl(-1.0);
constexpr int inf = (1 << 30) - (1 << 15); // 1,073,709,056
constexpr ll INF = (1LL << 62) - (1LL << 31); // 4,611,686,016,279,904,256
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class P1, class P2> void print(const pair<P1, P2>& a) { cout << a.first << " " << a.second << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> void print(const vector<T>& a) { cout_line(a, 0, a.size()); }
template<class S, class T> bool chmin(S& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class S, class T> bool chmax(S& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }
template<class T> vector<T> cumsum(const vector<T>& A, bool offset = false) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }
template<class T> string to_binary(T x, int B = 0) { string s; while (x) { s += ('0' + (x & 1)); x >>= 1; } while ((int)s.size() < B) { s += '0'; } reverse(s.begin(), s.end()); return s; }
template<class F> ll binary_search(const F& is_ok, ll ok, ll ng) { while (abs(ok - ng) > 1) { ll m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class F> double binary_search_real(const F& is_ok, double ok, double ng, int iter = 90) { for (int i = 0; i < iter; i++) { double m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class T> using PQ_max = priority_queue<T>;
template<class T> using PQ_min = priority_queue<T, vector<T>, greater<T>>;
template<class T> T pick(stack<T>& s) { assert(not s.empty()); T x = s.top(); s.pop(); return x; }
template<class T> T pick(queue<T>& q) { assert(not q.empty()); T x = q.front(); q.pop(); return x; }
template<class T> T pick_front(deque<T>& dq) { assert(not dq.empty()); T x = dq.front(); dq.pop_front(); return x; }
template<class T> T pick_back(deque<T>& dq) { assert(not dq.empty()); T x = dq.back(); dq.pop_back(); return x; }
template<class T> T pick(PQ_min<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }
template<class T> T pick(PQ_max<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }
template<class T> T pick(vector<T>& v) { assert(not v.empty()); T x = v.back(); v.pop_back(); return x; }
int to_int(const char c) { if (islower(c)) { return (c - 'a'); } if (isupper(c)) { return (c - 'A'); } if (isdigit(c)) { return (c - '0'); } assert(false); }
char to_a(const int i) { assert(0 <= i && i < 26); return ('a' + i); }
char to_A(const int i) { assert(0 <= i && i < 26); return ('A' + i); }
char to_d(const int i) { assert(0 <= i && i <= 9); return ('0' + i); }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll mod(ll x, ll m) { assert(m > 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digitlen(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll msb(ll b) { return (b <= 0 ? -1 : (63 - __builtin_clzll(b))); }
ll lsb(ll b) { return (b <= 0 ? -1 : __builtin_ctzll(b)); }
// --------------------------------------------------------
// 二次元グリッドを管理する構造体
template<class T = char>
struct Grid {
public:
Grid() {}
Grid(int H, int W) : H(H), W(W) {}
Grid(vector<string>& S) {
H = S.size();
W = S[0].size();
grid.resize(H, vector<T>(W, T(0)));
for (int h = 0; h < H; h++) {
for (int w = 0; w < W; w++) {
grid[h][w] = S[h][w];
}
}
}
Grid(vector<vector<T>>& S) {
H = S.size();
W = S[0].size();
grid.resize(H, vector<T>(W, T(0)));
for (int h = 0; h < H; h++) {
for (int w = 0; w < W; w++) {
grid[h][w] = S[h][w];
}
}
}
void set(int h, int w, T x) {
assert(on_grid(h, w));
grid[h][w] = x;
}
void set(int i, T x) {
assert(on_grid(i));
auto [h, w] = i_to_hw(i);
grid[h][w] = x;
}
T get(int h, int w) const {
assert(on_grid(h, w));
return grid[h][w];
}
T get(int i) const {
assert(on_grid(i));
auto [h, w] = i_to_hw(i);
return grid[h][w];
}
bool on_grid(int h, int w) const noexcept {
return (0 <= h && h < H && 0 <= w && w < W);
}
bool on_grid(int i) const noexcept {
return (0 <= i && i < H * W);
}
int hw_to_i(int h, int w) const {
assert(on_grid(h, w));
return h * W + w;
}
pair<int, int> i_to_hw(int i) const {
assert(on_grid(i));
return make_pair(i / W, i % W);
}
pair<int, int> find_position(T x) const noexcept {
for (int h = 0; h < H; h++) {
for (int w = 0; w < W; w++) {
if (grid[h][w] == x) {
return make_pair(h, w);
}
}
}
return make_pair(-1, -1);
}
pair<int, int> get_adj_4(int h, int w, int d) const {
assert(on_grid(h, w));
assert(0 <= d && d < 4);
int h2 = h + dh4[d];
int w2 = w + dw4[d];
if (not on_grid(h2, w2)) { h2 = w2 = -1; }
return make_pair(h2, w2);
}
pair<int, int> get_adj_8(int h, int w, int d) const {
assert(on_grid(h, w));
assert(0 <= d && d < 8);
int h2 = h + dh8[d];
int w2 = w + dw8[d];
if (not on_grid(h2, w2)) { h2 = w2 = -1; }
return make_pair(h2, w2);
}
vector<vector<int>> bfs(int sh, int sw, vector<T> ok_list = {'.'}) const {
assert(on_grid(sh, sw));
vector<vector<int>> dist(H, vector<int>(W, inf));
dist[sh][sw] = 0;
queue<pair<int, int>> q;
q.emplace(sh, sw);
while (not q.empty()) {
auto [h, w] = q.front(); q.pop();
for (int d = 0; d < 4; d++) {
int h2 = h + dh4[d];
int w2 = w + dw4[d];
if (not on_grid(h2, w2)) { continue; }
if (find(ok_list.begin(), ok_list.end(), grid[h2][w2]) == ok_list.end()) { continue; }
if (chmin(dist[h2][w2], dist[h][w] + 1)) { q.emplace(h2, w2); }
}
}
return dist;
}
private:
int H, W;
vector<vector<T>> grid;
const vector<int> dh4 = {0, 1, 0,-1}; // 右,下,左,上
const vector<int> dw4 = {1, 0,-1, 0};
const vector<int> dh8 = {0, 1, 1, 1, 0,-1,-1,-1}; // 右,右下,下,左下,左,左上,上,右上
const vector<int> dw8 = {1, 1, 0,-1,-1,-1, 0, 1};
};
// clang-format on
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
ll H, W, K, L, R;
input(H, W, K, L, R);
VS S(H);
REP (i, H) { input(S[i]); }
if (K % 2 != (H + W - 2) % 2) { END("No"); }
if ((R - L + 1) % 2 == 1) { END("No"); }
Grid grid(S);
auto dist1 = grid.bfs(0, 0);
auto distN = grid.bfs(H - 1, W - 1);
debug2(dist1);
debug2(distN);
const vector<int> dh4 = {0, 1, 0, -1}; // 右,下,左,上
const vector<int> dw4 = {1, 0, -1, 0};
auto on_grid = [&](int h, int w) -> bool { return (0 <= h && h < H && 0 <= w && w < W && S[h][w] == '.'); };
REP (h, H) {
REP (w, W) {
// auto f = [&](ll h1, ll w1, ll h2, ll w2, ll h3, ll w3, str T) -> void {
auto f = [&](ll h, ll w, str T) -> void {
if (dist1[h][w] == inf || distN[h][w] == inf) { return; }
debug(h + 1, w + 1);
if (not(dist1[h][w] <= L - 1 && (dist1[h][w] % 2 == (L - 1) % 2))) { return; }
if (not(distN[h][w] <= K - R && (distN[h][w] % 2 == (K - R) % 2))) { return; }
str ans;
ll A = h, B = w;
[&]() -> void {
VVI dist(H, VI(W, inf));
VVP memo(H, VP(W));
dist[0][0] = 0;
queue<pair<int, int>> q;
q.emplace(0, 0);
while (not q.empty()) {
auto [h, w] = q.front();
q.pop();
if (h == A && w == B) {
str res;
while (true) {
if (h == 0 && w == 0) { break; }
auto [h2, w2] = memo[h][w];
if (h2 + 1 == h) { res += "D"; }
if (h2 - 1 == h) { res += "U"; }
if (w2 + 1 == w) { res += "R"; }
if (w2 - 1 == w) { res += "L"; }
h = h2;
w = w2;
}
reverse(ALL(res));
ans += res;
return;
}
for (int d = 0; d < 4; d++) {
int h2 = h + dh4[d];
int w2 = w + dw4[d];
if (not on_grid(h2, w2)) { continue; }
if (chmin(dist[h2][w2], dist[h][w] + 1)) {
q.emplace(h2, w2);
memo[h2][w2] = {h, w};
}
}
}
}();
while (len(ans) < R) { ans += T; }
while (len(ans) + distN[h][w] < K) { ans += T; }
[&]() -> void {
VVI dist(H, VI(W, inf));
VVP memo(H, VP(W));
dist[H - 1][W - 1] = 0;
queue<pair<int, int>> q;
q.emplace(H - 1, W - 1);
while (not q.empty()) {
auto [h, w] = q.front();
q.pop();
if (h == A && w == B) {
str res;
while (true) {
if (h == H - 1 && w == W - 1) { break; }
auto [h2, w2] = memo[h][w];
if (h + 1 == h2) { res += "D"; }
if (h - 1 == h2) { res += "U"; }
if (w + 1 == w2) { res += "R"; }
if (w - 1 == w2) { res += "L"; }
h = h2;
w = w2;
}
ans += res;
return;
}
for (int d = 0; d < 4; d++) {
int h2 = h + dh4[d];
int w2 = w + dw4[d];
if (not on_grid(h2, w2)) { continue; }
if (chmin(dist[h2][w2], dist[h][w] + 1)) {
q.emplace(h2, w2);
memo[h2][w2] = {h, w};
}
}
}
}();
print("Yes");
print(ans);
exit(0);
};
// 横 3 マス
if (on_grid(h - 1, w) && on_grid(h, w) && on_grid(h + 1, w)) {
// f(h - 1, w, h, w, h + 1, w, "UD");
f(h, w, "UD");
}
// 縦 3 マス
if (on_grid(h, w - 1) && on_grid(h, w) && on_grid(h, w + 1)) {
// f(h, w - 1, h, w, h, w + 1, "LR");
f(h, w, "LR");
}
}
}
print("No");
return 0;
}