結果

問題 No.2411 Reverse Directions
ユーザー siganaisiganai
提出日時 2023-08-11 22:12:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 18 ms / 2,000 ms
コード長 9,691 bytes
コンパイル時間 2,487 ms
コンパイル使用メモリ 216,156 KB
実行使用メモリ 8,340 KB
最終ジャッジ日時 2023-08-11 22:13:01
合計ジャッジ時間 4,659 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 1 ms
4,384 KB
testcase_04 AC 6 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 5 ms
7,352 KB
testcase_08 AC 2 ms
4,384 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 12 ms
8,340 KB
testcase_11 AC 1 ms
4,384 KB
testcase_12 AC 17 ms
6,524 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 6 ms
4,384 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 2 ms
4,388 KB
testcase_17 AC 6 ms
4,512 KB
testcase_18 AC 3 ms
4,384 KB
testcase_19 AC 1 ms
4,380 KB
testcase_20 AC 5 ms
4,384 KB
testcase_21 AC 2 ms
4,384 KB
testcase_22 AC 12 ms
5,728 KB
testcase_23 AC 1 ms
4,384 KB
testcase_24 AC 17 ms
6,608 KB
testcase_25 AC 2 ms
4,384 KB
testcase_26 AC 2 ms
4,380 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 11 ms
5,060 KB
testcase_29 AC 18 ms
6,508 KB
testcase_30 AC 12 ms
5,424 KB
testcase_31 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int main() {
    INT(h,w,k,l,r);
    VEC(string,s,h);
    if(h + w - 2 > k || (k - h - w + 2) % 2 || (r - l + 1) % 2) {
        cout << "No\n";
        return 0;
    }
    l--;
    vvi g1(h,vi(w,-1)),g2(h,vi(w,-1));
    g1[0][0] = 0;
    g2[h-1][w-1] = 0;
    queue<pii> q;
    q.emplace(0,0);
    vvi pre1(h,vi(w,-1)),pre2(h,vi(w,-1));
    while(!q.empty()) {
        auto [px,py] = q.front();
        q.pop();
        rep(i,4) {
            int nx = px + dx[i] , ny = py + dy[i];
            if(0 <= nx && nx < h && 0 <= ny && ny < w) {
                if(s[nx][ny] == '.' && g1[nx][ny] == -1 && g1[px][py] < l) {
                    g1[nx][ny] = g1[px][py] + 1;
                    q.emplace(nx,ny);
                    pre1[nx][ny] = i;    
                }
            }
        }
    }
    q.emplace(h-1,w-1);
    while(!q.empty()) {
        auto [px,py] = q.front();
        q.pop();
        rep(i,4) {
            int nx = px + dx[i] , ny = py + dy[i];
            if(0 <= nx && nx < h && 0 <= ny && ny < w) {
                if(s[nx][ny] == '.' && g2[nx][ny] == -1 && g2[px][py] < k - r) {
                    g2[nx][ny] = g2[px][py] + 1;
                    q.emplace(nx,ny);
                    pre2[nx][ny] = i;    
                }
            }
        }
    }  
    
    
    rep(i,h) {
        rep(j,w) {
            if(s[i][j] == '.' && g1[i][j] != -1 && g2[i][j] != -1 && (l - g1[i][j]) % 2 == 0) {
                if(i > 0 && i < h - 1 && s[i-1][j] == '.' && s[i+1][j] == '.') {
                    string ans;
                    int nx = i,ny = j;
                    while(nx > 0 || ny > 0) {
                        if(pre1[nx][ny] == 0) ans += 'D';
                        else if(pre1[nx][ny] == 1) ans += 'U';
                        else if(pre1[nx][ny] == 2) ans += 'R';
                        else ans += 'L';
                        int px = nx - dx[pre1[nx][ny]],py = ny - dy[pre1[nx][ny]];
                        nx = px,ny = py;
                        debug(nx,ny);
                    }
                    reverse(all(ans));
                    int d = l - (int)ans.size();
                    rep(i,d) {
                        if(ans.back() == 'U') ans += 'D';
                        else if(ans.back() == 'D') ans += 'U';
                        else if(ans.back() == 'R') ans += 'L';
                        else ans += 'R';
                    } 
                    debug(ans);
                    rep((r - l) / 2) {
                        ans += 'U';
                        ans += 'D';
                    }
                    debug(ans);
                    nx = i,ny = j;
                    while(nx < h - 1 || ny < w - 1) {
                        if(pre2[nx][ny] == 0) ans += 'U';
                        else if(pre2[nx][ny] == 1) ans += 'D';
                        else if(pre2[nx][ny] == 2) ans += 'L';
                        else ans += 'R';
                        int px = nx - dx[pre2[nx][ny]],py = ny - dy[pre2[nx][ny]];
                        nx = px,ny = py;
                        debug(nx,ny);
                    }
                    d = k - (int)ans.size();
                    rep(i,d) {
                        if(ans.back() == 'U') ans += 'D';
                        else if(ans.back() == 'D') ans += 'U';
                        else if(ans.back() == 'R') ans += 'L';
                        else ans += 'R';
                    }
                    cout << "Yes\n";
                    cout << ans << '\n';
                    return 0;
                }
                if(j > 0 && j < w - 1 && s[i][j-1] == '.' && s[i][j+1] == '.') {
                    string ans;
                    int nx = i,ny = j;
                    while(nx > 0 || ny > 0) {
                        if(pre1[nx][ny] == 0) ans += 'D';
                        else if(pre1[nx][ny] == 1) ans += 'U';
                        else if(pre1[nx][ny] == 2) ans += 'R';
                        else ans += 'L';
                        int px = nx - dx[pre1[nx][ny]],py = ny - dy[pre1[nx][ny]];
                        nx = px,ny = py;
                    }
                    reverse(all(ans));
                    int d = l - (int)ans.size();
                    rep(i,d) {
                        if(ans.back() == 'U') ans += 'D';
                        else if(ans.back() == 'D') ans += 'U';
                        else if(ans.back() == 'R') ans += 'L';
                        else ans += 'R';
                    } 
                    rep((r - l) / 2) {
                        ans += 'L';
                        ans += 'R';
                    }
                    nx = i,ny = j;
                    while(nx < h - 1 || ny < w - 1) {
                        if(pre2[nx][ny] == 0) ans += 'U';
                        else if(pre2[nx][ny] == 1) ans += 'D';
                        else if(pre2[nx][ny] == 2) ans += 'L';
                        else ans += 'R';
                        int px = nx - dx[pre2[nx][ny]],py = ny - dy[pre2[nx][ny]];
                        nx = px,ny = py;
                    }
                    d = k - (int)ans.size();
                    rep(i,d) {
                        if(ans.back() == 'U') ans += 'D';
                        else if(ans.back() == 'D') ans += 'U';
                        else if(ans.back() == 'R') ans += 'L';
                        else ans += 'R';
                    }
                    cout << "Yes\n";
                    cout << ans << '\n';
                    return 0;
                }
            }
        }
    }
    
    cout << "No\n";
}
0