結果
| 問題 |
No.2411 Reverse Directions
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2023-08-11 23:06:52 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,271 bytes |
| コンパイル時間 | 3,821 ms |
| コンパイル使用メモリ | 264,344 KB |
| 最終ジャッジ日時 | 2025-02-16 02:03:13 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 21 WA * 8 |
ソースコード
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128;
#define endl '\n'
lint const mod107 = 1e9+7;
using mint107 = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true;
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()
unsigned long long Rand(){
static unsigned long long x=88172645463325252LL;
x^=(x<<13);
x^=(x>>7);
return (x^=(x<<17));
}
struct Frac {
lint upper, lower;
Frac() {
Frac(0,1);
}
Frac(lint u, lint l) {
assert(l != 0);
if(u <= 0 && l < 0) {
upper = -u;
lower = -l;
} else {
upper = u;
lower = l;
}
reduction();
}
Frac(lint u) {
upper = u;
lower = 1;
}
void reduction() {
if(upper != 0) {
lint g = gcd(abs(upper), abs(lower));
upper /= g;
lower /= g;
if(lower < 0) {
lower *= -1;
upper *= -1;
}
} else {
lower = 1;
}
}
Frac operator+(const Frac &other) {
lint L = lower * other.lower;
lint U = upper*other.lower + lower*other.upper;
return Frac(U, L);
}
Frac operator-(const Frac &other) {
lint L = lower * other.lower;
lint U = upper*other.lower - lower*other.upper;
upper = U;
lower = L;
return Frac(U, L);
}
bool operator<=(const Frac &other) {
return upper*other.lower <= lower*other.upper;
}
Frac operator*(const Frac &other) {
lint L = lower * other.lower;
lint U = upper * other.upper;
return Frac(U, L);
}
Frac operator/(const Frac &other) {
assert(other.upper != 0);
lint L = lower * other.upper;
lint U = upper * other.lower;
return Frac(U, L);
}
};
bool operator<(const Frac &left, const Frac &right) {
return left.upper*right.lower < left.lower*right.upper;
}
struct edge{
int to;
};
using graph = vector<vector<edge>>;
char rev(char c) {
if(c == 'L') return 'R';
else if(c == 'R') return 'L';
else if(c == 'U') return 'D';
else return 'U';
}
int main(){
int h,w,k, l, r;
cin >> h >> w >> k >> l >> r;
vec<vec<char>>s(h+2, vec<char>(w+2, '#'));
rep(i ,h) {
rep(j, w) {
cin >> s[i+1][j+1];
}
}
if((r-l)%2 == 0 || (h+w)%2 != k%2) {
cout << "No" << endl;
return 0;
}
vec<vec<int>>dist(h+2, vec<int>(w+2, INF));
dist[1][1] = 0;
queue<pair<int,int>>que;
que.push({1, 1});
vec<int>dx = {1,-1,0,0};
vec<int>dy = {0,0,1,-1};
string D = "DURL";
while(que.size() > 0) {
auto q = que.front();
int x = q.first;
int y = q.second;
que.pop();
rep(d, 4) {
int nx = x + dx[d];
int ny = y + dy[d];
if(s[nx][ny] == '#')continue;
if(dist[nx][ny] > dist[x][y] + 1) {
que.push({nx, ny});
dist[nx][ny] = dist[x][y] + 1;
}
}
}
if(dist[h][w] == INF) {
cout << "No" << endl;
return 0;
}
int x = h;
int y = w;
string S = "";
while(x > 1 || y > 1) {
// cerr << x << " " << y << endl;
rep(d, 4) {
int nx = x + dx[d];
int ny = y + dy[d];
if(dist[nx][ny] < dist[x][y]) {
S = rev(D[d]) + S;
x = nx; y = ny;
break;
}
}
}
string ans = "";
int t = 0;
int u = 0;
l--;r--;
bool chk = false;
rep(i, k) {
if(i >= l && i <= r) {
if(u == 0) ans += (S[t]);
else ans += rev(S[t]);
u = !u;
} else if(t == S.size()-1) {
if(!chk) {
chk = true;
u = 0;
}
if(u == 0) {
ans += S[t];
} else {
ans += rev(S[t]);
}
u = !u;
} else {
ans += S[t];
t++;
}
}
if(chk && u != 0) {
cout << "Yes" << endl;
cout << ans << endl;
} else {
cout << "No" << endl;
}
}