結果

問題 No.2411 Reverse Directions
ユーザー heno239heno239
提出日時 2023-08-12 19:27:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 8,973 bytes
コンパイル時間 3,043 ms
コンパイル使用メモリ 186,484 KB
実行使用メモリ 19,064 KB
最終ジャッジ日時 2024-11-20 09:59:20
合計ジャッジ時間 5,019 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
11,720 KB
testcase_01 AC 7 ms
11,720 KB
testcase_02 AC 7 ms
11,720 KB
testcase_03 AC 7 ms
11,844 KB
testcase_04 AC 11 ms
13,000 KB
testcase_05 AC 7 ms
11,716 KB
testcase_06 AC 7 ms
11,724 KB
testcase_07 AC 13 ms
18,116 KB
testcase_08 AC 7 ms
11,848 KB
testcase_09 AC 7 ms
11,716 KB
testcase_10 AC 22 ms
19,064 KB
testcase_11 AC 7 ms
11,720 KB
testcase_12 AC 26 ms
16,580 KB
testcase_13 AC 7 ms
11,720 KB
testcase_14 AC 12 ms
13,256 KB
testcase_15 AC 9 ms
11,980 KB
testcase_16 AC 9 ms
12,104 KB
testcase_17 AC 13 ms
13,512 KB
testcase_18 AC 10 ms
12,360 KB
testcase_19 AC 7 ms
11,724 KB
testcase_20 AC 12 ms
13,000 KB
testcase_21 AC 13 ms
14,152 KB
testcase_22 AC 20 ms
15,192 KB
testcase_23 AC 8 ms
11,848 KB
testcase_24 AC 24 ms
16,456 KB
testcase_25 AC 7 ms
11,724 KB
testcase_26 AC 7 ms
11,976 KB
testcase_27 AC 10 ms
12,996 KB
testcase_28 AC 17 ms
14,888 KB
testcase_29 AC 26 ms
16,968 KB
testcase_30 AC 19 ms
15,176 KB
testcase_31 AC 19 ms
14,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

void solve() {
	int h, w, k, l, r; cin >> h >> w >> k >> l >> r;
	vector<string> s(h);
	rep(i, h)cin >> s[i];
	if ((r - l + 1) % 2) {
		cout << "No\n"; return;
	}
	auto isok = [&](int i, int j) {
		if (i < 0 || i >= h || j < 0 || j >= w)return false;
		return s[i][j] == '.';
	};
	auto calc = [&](vector<vector<int>>& dist,vector<vector<P>> &pre, int ci, int cj) {
		rep(i, h)rep(j, w)dist[i][j] = mod17;
		queue<P> q;
		q.push({ ci,cj });
		dist[ci][cj] = 0;
		while (!q.empty()) {
			P p = q.front(); q.pop();
			int i = p.first, j = p.second;
			rep(d, 4) {
				int ni = i + dx[d];
				int nj = j + dy[d];
				if (isok(ni, nj) && dist[ni][nj] > dist[i][j] + 1) {
					dist[ni][nj] = dist[i][j] + 1;
					pre[ni][nj] = { i,j };
					q.push({ ni,nj });
				}
			}
		}
	};
	vector<vector<int>> dists(h, vector<int>(w));
	vector < vector<P> > pres(h, vector<P>(w));
	auto distt = dists;
	auto pret = pres;
	calc(dists, pres, 0, 0);
	calc(distt, pret, h - 1, w - 1);
	vector<vector<bool>> cans(h, vector<bool>(w));
	rep(i, h)rep(j, w) {
		int d = dists[i][j];
		if ((d + l - 1) % 2 == 0 && d <= l - 1) {
			cans[i][j] = true;
		}
	}
	vector<vector<bool>> cant(h, vector<bool>(w));
	rep(i, h)rep(j, w) {
		int d = distt[i][j];
		if ((d + k - r) % 2 == 0 && d <= k - r) {
			cant[i][j] = true;
		}
	}
	rep(i, h)rep(j, w) {
		if (i == 1 && j == 1) {
			//cout << cans[i][j] << " " << cant[i][j] << "\n";
		}
		if (!cans[i][j] || !cant[i][j])continue;
		if (isok(i, j) && isok(i, j - 1) && isok(i, j + 1)) {
			string ans;
			string ans1, ans2, ans3;
			P cur = { i,j };
			while (cur != P{0, 0}) {
				P pre = pres[cur.first][cur.second];
				rep(d, 4) {
					int ni = pre.first + dx[d];
					int nj = pre.second + dy[d];
					if (cur == P{ ni,nj })ans1.push_back(drul[d]);
				}
				cur = pre;
			}
			reverse(all(ans1));
			while (ans1.size() < l - 1) {
				ans1 += "LR";
			}
			while (ans2.size() < r - l + 1) {
				ans2 += "LR";
			}
			cur = { i,j };
			while (cur != P{ h-1,w-1 }) {
				P pre = pret[cur.first][cur.second];
				rep(d, 4) {
					int ni = pre.first + dx[d];
					int nj = pre.second + dy[d];
					if (cur == P{ ni,nj })ans3.push_back(drul[d^2]);
				}
				cur = pre;
			}
			reverse(all(ans3));
			while (ans3.size() < k-r) {
				ans3 += "LR";
			}
			reverse(all(ans3));
			ans = ans1 + ans2 + ans3;
			cout << "Yes\n";
			cout << ans << "\n";
			return;
		}
		if (isok(i, j) && isok(i - 1, j) && isok(i + 1, j)) {
			string ans;
			string ans1, ans2, ans3;
			P cur = { i,j };
			while (cur != P{ 0, 0 }) {
				P pre = pres[cur.first][cur.second];
				rep(d, 4) {
					int ni = pre.first + dx[d];
					int nj = pre.second + dy[d];
					if (cur == P{ ni,nj })ans1.push_back(drul[d]);
				}
				cur = pre;
			}
			reverse(all(ans1));
			while (ans1.size() < l - 1) {
				ans1 += "DU";
			}
			while (ans2.size() < r - l + 1) {
				ans2 += "DU";
			}
			cur = { i,j };
			while (cur != P{ h - 1,w - 1 }) {
				P pre = pret[cur.first][cur.second];
				rep(d, 4) {
					int ni = pre.first + dx[d];
					int nj = pre.second + dy[d];
					if (cur == P{ ni,nj })ans3.push_back(drul[d]);
				}
				cur = pre;
			}
			while (ans3.size() < k - r) {
				ans3 += "DU";
			}
			reverse(all(ans3));
			ans = ans1 + ans2 + ans3;
			cout << "Yes\n";
			cout << ans << "\n";
			return;
		}
	}
	cout << "No\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	//init();
	//init2();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0