結果

問題 No.2411 Reverse Directions
コンテスト
ユーザー apricity
提出日時 2024-01-13 19:10:27
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,744 bytes
コンパイル時間 1,654 ms
コンパイル使用メモリ 140,164 KB
最終ジャッジ日時 2025-02-18 19:48:54
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16 WA * 13
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

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;
}
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...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
const string dirs = "DRUL";

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int h,w,k,l,r; in(h,w,k,l,r); l--;
    vector<string> s(h); in(s);
    if(l%2 != r%2){
        out("No");
        return 0;
    }

    vector<vector<int>> ds(h,vector<int> (w,-1));
    vector<vector<int>> dg(h,vector<int> (w,-1));
    vector<vector<int>> prev_s(h,vector<int> (w));
    vector<vector<int>> prev_g(h,vector<int> (w));

    ds[0][0] = 0;
    dg[h-1][w-1] = 0;
    queue<P> q;
    q.push({0,0});
    while(q.size()){
        auto [i,j] = q.front(); q.pop();
        rep(k,4){
            int ni = i+dx[k], nj = j+dy[k];
            if(ni < 0 or nj < 0 or ni >= h or nj >= w) continue;
            if(s[ni][nj] == '#') continue;
            if(ds[ni][nj] != -1) continue;
            ds[ni][nj] = ds[i][j]+1;
            prev_s[ni][nj] = k;
            q.push({ni,nj});
        }
    }
    q.push({h-1,w-1});
    while(q.size()){
        auto [i,j] = q.front(); q.pop();
        rep(k,4){
            int ni = i+dx[k], nj = j+dy[k];
            if(ni < 0 or nj < 0 or ni >= h or nj >= w) continue;
            if(s[ni][nj] == '#') continue;
            if(dg[ni][nj] != -1) continue;
            dg[ni][nj] = dg[i][j]+1;
            prev_g[ni][nj] = (k+2)%4;
            q.push({ni,nj});
        }
    }

    FOR(i,1,h-1)FOR(j,1,w-1){
        if(s[i][j] == '#') continue;
        if(ds[i][j] == -1) continue;
        if(ds[i][j] > l or dg[i][j] > k-r) continue;
        if(ds[i][j]%2 != l%2) continue;
        if(dg[i][j]%2 != (k-r)%2) continue;
        int ok = 0;
        string t1,t2,t3;
        if(s[i-1][j] == '.' and s[i+1][j] == '.'){
            ok = 1;
            rep(_,(r-l)/2) t2 += 'U', t2 += 'D';
            int nx = i, ny = j;
            while(nx != 0 or ny != 0){
                t1 += dirs[prev_s[nx][ny]];
                nx -= dx[prev_s[nx][ny]];
                ny -= dy[prev_s[nx][ny]];
            }
            reverse(ALL(t1));
            rep(_, (l-ds[i][j])/2) t1 += 'U', t1 += 'D';

            nx = i, ny = j;
            while(nx != h-1 or ny != w-1){
                t3 += dirs[prev_g[nx][ny]];
                nx += dx[prev_g[nx][ny]];
                ny += dy[prev_g[nx][ny]];
            }
            rep(_, (k-r-dg[i][j])/2) t3 += 'U', t1 += 'D';
            reverse(ALL(t3));
        }
        else if(s[i][j-1] == '.' and s[i][j+1] == '.'){
            ok = 1;
            rep(_,(r-l)/2) t2 += 'L', t2 += 'R';
            int nx = i, ny = j;
            while(nx != 0 or ny != 0){
                t1 += dirs[prev_s[nx][ny]];
                nx -= dx[prev_s[nx][ny]];
                ny -= dy[prev_s[nx][ny]];
            }
            reverse(ALL(t1));
            rep(_, (l-ds[i][j])/2) t1 += 'L', t1 += 'R';

            nx = i, ny = j;
            while(nx != h-1 or ny != w-1){
                t3 += dirs[prev_g[nx][ny]];
                nx += dx[prev_g[nx][ny]];
                ny += dy[prev_g[nx][ny]];
            }
            rep(_, (k-r-dg[i][j])/2) t3 += 'L', t1 += 'R';
            reverse(ALL(t3));
        }
        if(ok){
            out("Yes");
            out(t1+t2+t3);
            return 0;
        }
    }
    out("No");
}
0