結果

問題 No.2411 Reverse Directions
ユーザー jabeejabee
提出日時 2023-08-11 23:50:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,692 bytes
コンパイル時間 5,002 ms
コンパイル使用メモリ 288,520 KB
実行使用メモリ 24,100 KB
最終ジャッジ日時 2024-11-18 19:37:06
合計ジャッジ時間 8,084 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
18,944 KB
testcase_01 AC 27 ms
18,960 KB
testcase_02 AC 27 ms
18,940 KB
testcase_03 AC 28 ms
18,964 KB
testcase_04 WA -
testcase_05 AC 27 ms
18,920 KB
testcase_06 AC 27 ms
18,936 KB
testcase_07 AC 50 ms
23,144 KB
testcase_08 AC 27 ms
18,920 KB
testcase_09 AC 27 ms
18,940 KB
testcase_10 AC 45 ms
24,100 KB
testcase_11 WA -
testcase_12 AC 47 ms
22,256 KB
testcase_13 AC 31 ms
19,772 KB
testcase_14 AC 33 ms
20,044 KB
testcase_15 AC 29 ms
19,308 KB
testcase_16 AC 27 ms
19,268 KB
testcase_17 AC 33 ms
20,088 KB
testcase_18 AC 30 ms
19,324 KB
testcase_19 AC 28 ms
18,908 KB
testcase_20 AC 32 ms
19,916 KB
testcase_21 AC 32 ms
20,468 KB
testcase_22 AC 41 ms
21,400 KB
testcase_23 AC 35 ms
20,340 KB
testcase_24 AC 46 ms
22,068 KB
testcase_25 AC 28 ms
19,376 KB
testcase_26 AC 29 ms
19,096 KB
testcase_27 WA -
testcase_28 AC 39 ms
20,788 KB
testcase_29 AC 50 ms
22,328 KB
testcase_30 AC 41 ms
21,208 KB
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }
 
//---------------------------------------------------------------------------------------------------
 
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------
void _main() {
  ll h,w,k,l,r;
  cin >> h >> w >> k >> l >> r;
  vector<string>s(h);
  rep(i,0,h)cin >> s[i];
  vector dp1(h,vector<ll>(w,infl));
  vector dp2(h,vector<ll>(w,infl));
  vector<ll>di = {0,1,0,-1};
  vector<ll>dj = {1,0,-1,0};
  map<P,char>mp;
  mp[{0,1}] = 'L';
  mp[{0,-1}] = 'R';
  mp[{1,0}] = 'U';
  mp[{-1,0}] = 'D';
  rep(ti,0,2){
    ll si = 0;
    ll sj = 0;
    if(ti == 1)si = h - 1;
    if(ti == 1)sj = w - 1;
    queue<P>q;
    q.push({si,sj});
    dp1[si][sj] = 0;
    while(q.size()){
      ll i = q.front().first;
      ll j = q.front().second;
    //  cerr << i << " " << j << endl;
      q.pop();
      rep(dir,0,4){
        ll ni = i + di[dir];
        ll nj = j + dj[dir];       
        if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;
        if(s[ni][nj] == '#')continue;
        if(chmin(dp1[ni][nj],dp1[i][j]+1))q.push({ni,nj});
      }
    }
    swap(dp1,dp2);
  }

/*
  rep(i,0,h){
    rep(j,0,w){
    cout << dp1[i][j];
    }
    cout << endl;
  }
  rep(i,0,h){
    
    rep(j,0,w){
    cout << dp2[i][j];
    }
    cout << endl;
  }
  return ;
  */
  if((r-l)%2 == 0){
    cout << no << endl;
  }else{
 //   cerr << "test" << endl;
    rep(i,0,h)rep(j,0,w){
      if(dp1[i][j] + dp2[i][j] + r - l + 1 > k )continue;
      string ans1 = "";
      string ans2 = "";
      ll si = i;
      ll sj = j;
      ll sd = dp1[si][sj];
      while(sd != 0){
        rep(dir,0,4){
          ll ni = si + di[dir];
          ll nj = sj + dj[dir];
          if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;
          if(s[ni][nj] == '#')continue;
          if(sd - dp1[ni][nj] != 1)continue;
          ans1 += mp[{di[dir],dj[dir]}];
//          ans1 += mp[{di[(dir+2)%4],dj[(dir+2)%4]}];
          si = ni;
          sj = nj;
          sd = dp1[si][sj]; 
          break;       
        }
      }
      reverse(all(ans1));
      si = i;
      sj = j;
      sd = dp2[si][sj];
      //cerr << si << " " << sj << " " << sd << endl;
      while(sd != 0){
        rep(dir,0,4){
          ll ni = si + di[dir];
          ll nj = sj + dj[dir];
          if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;
          if(s[ni][nj] == '#')continue;
          if(sd - dp2[ni][nj]!= 1)continue;
          ans2 += mp[{di[(dir+2)%4],dj[(dir+2)%4]}];
        //  ans2 += mp[{di[dir],dj[dir]}];
          si = ni;
          sj = nj;
          sd = dp2[si][sj];
          break;   
        }
      }
      
      string ans3 = "";
      ll dirval = -1;
      si = i;
      sj = j;

      bool ok = false;
      rep(dir,0,2){
        bool temp = true;
        ll ni = i + di[dir];
        ll nj = j + dj[dir];
        if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;
        if(s[ni][nj] == '#')continue;
        ni = i + di[(dir + 2)%4];
        nj = j + dj[(dir + 2)%4];
        if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;
        if(s[ni][nj] == '#')continue;
        ok = true;
        break;        
      }
      if(ok == false)continue;
      
      rep(dir,0,4){
          ll ni = i + di[dir];
          ll nj = j + dj[dir];
          if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;
          if(s[ni][nj] == '#')continue;
          dirval = dir;
          break;
      }
      rep(l,0,k - dp1[i][j] - dp2[i][j]){
        if(l % 2 == 1)ans3 += mp[{di[dirval],dj[dirval]}];
        else ans3 += mp[{di[(dirval + 2)%4],dj[(dirval + 2)%4]}];
      }
     // cout << i << j << endl;
    //  cout << ans1 << endl;
    //  cout << ans2 << endl;
    //  cout << ans3 << endl;
      cout << ye << endl;
      cout << ans1 << ans3 << ans2 << endl;
      return;
    }
    cout << no << endl;
  }
}
0