結果
| 問題 |
No.2411 Reverse Directions
|
| コンテスト | |
| ユーザー |
 だれ
|
| 提出日時 | 2023-08-11 22:17:47 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,849 bytes |
| コンパイル時間 | 3,411 ms |
| コンパイル使用メモリ | 204,340 KB |
| 最終ジャッジ日時 | 2025-02-16 01:34:11 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 WA * 5 |
ソースコード
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(x) \
std::sort((x).begin(), (x).end()); \
(x).erase(std::unique((x).begin(), (x).end()), (x).end())
using i64 = long long;
template <class T, class U>
bool chmin(T& a, const U& b) {
return (b < a) ? (a = b, true) : false;
}
template <class T, class U>
bool chmax(T& a, const U& b) {
return (b > a) ? (a = b, true) : false;
}
inline void YesNo(bool f = 0, string yes = "Yes", string no = "No") {
std::cout << (f ? yes : no) << "\n";
}
namespace io {
template <typename T>
istream& operator>>(istream& i, vector<T>& v) {
rep(j, v.size()) i >> v[j];
return i;
}
template <typename T>
string join(vector<T>& v) {
stringstream s;
rep(i, v.size()) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T>
ostream& operator<<(ostream& o, vector<T>& v) {
if (v.size()) o << join(v);
return o;
}
template <typename T>
string join(vector<vector<T>>& vv) {
string s = "\n";
rep(i, vv.size()) s += join(vv[i]) + "\n";
return s;
}
template <typename T>
ostream& operator<<(ostream& o, vector<vector<T>>& vv) {
if (vv.size()) o << join(vv);
return o;
}
template <class T, class U>
istream& operator>>(istream& i, pair<T, U>& p) {
i >> p.first >> p.second;
return i;
}
template <class T, class U>
ostream& operator<<(ostream& o, pair<T, U>& p) {
o << p.first << " " << p.second;
return o;
}
void print() { cout << "\n"; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << ' ';
print(std::forward<Tail>(tail)...);
}
void in() {}
template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
cin >> head;
in(std::forward<Tail>(tail)...);
}
} // namespace io
using namespace io;
namespace useful {
long long modpow(long long a, long long b, long long mod) {
long long res = 1;
while (b) {
if (b & 1) res *= a, res %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return res;
}
bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }
template <class T>
void rearrange(vector<T>& a, vector<int>& p) {
vector<T> b = a;
for (int i = 0; i < int(a.size()); i++) {
a[i] = b[p[i]];
}
return;
}
template <class T>
vector<pair<int, int>> rle_sequence(T& a) {
vector<pair<int, int>> res;
int n = a.size();
if (n == 1) return vector<pair<int, int>>{{a[0], 1}};
int l = 1;
rep(i, n - 1) {
if (a[i] == a[i + 1])
l++;
else {
res.emplace_back(a[i], l);
l = 1;
}
}
res.emplace_back(a.back(), l);
return res;
}
vector<pair<char, int>> rle_string(string a) {
vector<pair<char, int>> res;
int n = a.size();
if (n == 1) return vector<pair<char, int>>{{a[0], 1}};
int l = 1;
rep(i, n - 1) {
if (a[i] == a[i + 1])
l++;
else {
res.emplace_back(a[i], l);
l = 1;
}
}
res.emplace_back(a.back(), l);
return res;
}
vector<int> linear_sieve(int n) {
vector<int> primes;
vector<int> res(n + 1);
iota(all(res), 0);
for (int i = 2; i <= n; i++) {
if (res[i] == i) primes.emplace_back(i);
for (auto j : primes) {
if (j * i > n) break;
res[j * i] = j;
}
}
return res;
// return primes;
}
template <class T>
vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) {
int n = graph.size();
vector<long long> res(n, 2e18);
res[start] = 0;
priority_queue<pair<long long, int>, vector<pair<long long, int>>,
greater<pair<long long, int>>>
que;
que.push({0, start});
while (!que.empty()) {
auto [c, v] = que.top();
que.pop();
if (res[v] < c) continue;
for (auto [nxt, cost] : graph[v]) {
auto x = c + cost;
if (x < res[nxt]) {
res[nxt] = x;
que.push({x, nxt});
}
}
}
return res;
}
} // namespace useful
using namespace useful;
using mint = atcoder::modint998244353;
vector<mint> fact_calc(int x) {
vector<mint> res(x + 1);
res[0] = 1;
for (int i = 0; i < x; i++) {
res[i + 1] = res[i] * (i + 1);
}
return res;
}
vector<mint> ifact_calc(int x) {
vector<mint> res(x + 1);
mint t = 1;
for (int i = 1; i <= x; i++) {
t *= i;
}
// res[x] = t.inverse();
res[x] = t.inv();
for (int i = x; i > 0; i--) {
res[i - 1] = res[i] * i;
}
return res;
}
auto fact = fact_calc(600005);
auto ifact = ifact_calc(600005);
mint comb(int x, int y) {
if (x < 0 || y < 0 || x - y < 0) return 0;
return fact[x] * ifact[y] * ifact[x - y];
}
mint perm(int x, int y) {
if (x < 0 || x - y < 0) return 0;
return fact[x] * ifact[x - y];
}
int h, w;
bool check(int i, int j) { return 0 <= i && i < h && 0 <= j && j < w; }
vector<int> di = {1, -1, 0, 0};
vector<int> dj = {0, 0, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int k, l, r;
in(h, w, k, l, r);
if ((r - l + 1) & 1) {
print("No");
return 0;
}
vector<string> s(h);
in(s);
vector isok(h, vector<int>(w));
rep(i, h) rep(j, w) {
if (s[i][j] == '#') continue;
int f = 0;
if (i + 1 < h && i - 1 >= 0) {
if (s[i - 1][j] == '.' && s[i + 1][j] == '.') f = 1;
}
if (j + 1 < w && j - 1 >= 0) {
if (s[i][j - 1] == '.' && s[i][j + 1] == '.') f = 2;
}
isok[i][j] = f;
}
vector dist(h, vector<int>(w, 1e9));
vector huku(h, vector<pair<int, int>>(w, pair{-1, -1}));
vector distrev(h, vector<int>(w, 1e9));
vector hukurev(h, vector<pair<int, int>>(w, pair{-1, -1}));
queue<pair<int, int>> que;
que.emplace(0, 0);
dist[0][0] = 0;
while (que.size()) {
auto [i, j] = que.front();
que.pop();
rep(x, 4) {
auto ni = i + di[x], nj = j + dj[x];
if (check(ni, nj)) {
if (s[ni][nj] == '#') continue;
if (chmin(dist[ni][nj], dist[i][j] + 1)) {
huku[ni][nj] = {i, j};
que.emplace(ni, nj);
}
}
}
}
que.emplace(h - 1, w - 1);
distrev[h - 1][w - 1] = 0;
while (que.size()) {
auto [i, j] = que.front();
que.pop();
rep(x, 4) {
auto ni = i + di[x], nj = j + dj[x];
if (check(ni, nj)) {
if (s[ni][nj] == '#') continue;
if (chmin(distrev[ni][nj], distrev[i][j] + 1)) {
hukurev[ni][nj] = {i, j};
que.emplace(ni, nj);
}
}
}
}
rep(i, h) rep(j, w) {
if (isok[i][j] > 0) {
auto fr = dist[i][j], bk = distrev[i][j];
bool f = true;
if (fr > l - 1) f = false;
if (((l - 1) - fr) & 1) f = false;
if (bk > k - r) f = false;
if ((k - r - bk) & 1) f = false;
if (f) {
print("Yes");
string ans;
auto ni = i, nj = j;
while (dist[ni][nj] > 0) {
if (ni > 0 && dist[ni - 1][nj] == dist[ni][nj] - 1) {
ans += 'D';
ni--;
} else if (ni + 1 < h &&
dist[ni + 1][nj] == dist[ni][nj] - 1) {
ans += 'U';
ni++;
} else if (nj > 0 && dist[ni][nj - 1] == dist[ni][nj] - 1) {
ans += 'R';
nj--;
} else {
ans += 'L';
nj++;
}
}
rep(_,
((l - 1) - fr) / 2 + (k - r - bk) / 2 + (r - l + 1) / 2) {
if (isok[i][j] == 1) {
ans += 'U';
ans += 'D';
} else {
ans += 'L';
ans += 'R';
}
}
ni = i, nj = j;
while (distrev[ni][nj] > 0) {
if (ni > 0 && distrev[ni - 1][nj] == distrev[ni][nj] - 1) {
ans += 'U';
ni--;
} else if (ni + 1 < h &&
distrev[ni + 1][nj] == distrev[ni][nj] - 1) {
ans += 'D';
ni++;
} else if (nj > 0 &&
distrev[ni][nj - 1] == distrev[ni][nj] - 1) {
ans += 'L';
nj--;
} else {
ans += 'R';
nj++;
}
}
print(ans);
return 0;
}
}
}
print("No");
}