結果
| 問題 | No.2411 Reverse Directions |
| ユーザー |
 woodywoody
|
| 提出日時 | 2023-08-11 22:31:31 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 103 ms / 2,000 ms |
| コード長 | 7,220 bytes |
| コンパイル時間 | 4,502 ms |
| コンパイル使用メモリ | 246,304 KB |
| 実行使用メモリ | 23,632 KB |
| 最終ジャッジ日時 | 2024-11-18 17:14:10 |
| 合計ジャッジ時間 | 6,931 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 29 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,b) for(int i=0;i<b;i++)#define rrep(i,b) for(int i=b-1;i>=0;i--)#define rep1(i,b) for(int i=1;i<b;i++)#define repx(i,x,b) for(int i=x;i<b;i++)#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)#define fore(i,a) for(auto& i:a)#define rng(x) (x).begin(), (x).end()#define rrng(x) (x).rbegin(), (x).rend()#define sz(x) ((int)(x).size())#define pb push_back#define fi first#define se second#define pcnt __builtin_popcountllusing namespace std;using namespace atcoder;using ll = long long;using ld = long double;template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}#define retval(x) {cout << #x << endl; return;}#define cout2(x,y) cout << x << " " << y << endl;#define coutp(p) cout << p.fi << " " << p.se << endl;#define out cout << ans << endl;#define outd cout << fixed << setprecision(20) << ans << endl;#define outm cout << ans.val() << endl;#define outv fore(yans , ans) cout << yans << "\n";#define outdv fore(yans , ans) cout << yans.val() << "\n";#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define coutv2(v) fore(vy , v) cout << vy << "\n";#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;using mint = modint998244353;//using mint = modint1000000007;//using mint = dynamic_modint<0>;using vm = vector<mint>;using vvm = vector<vector<mint>>;vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}#define yes {cout <<"Yes"<<endl;}#define no {cout <<"No"<<endl;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#ifdef MY_LOCAL_DEBUG#define show(x) cerr<<#x<<" = "<<x<<endl#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl#define test(x) cout << "test" << x << endl#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define showv2(v) fore(vy , v) cout << vy << "\n";#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";#else#define show(x)#define showp(p)#define show2(x,y)#define show3(x,y,z)#define show4(x,y,z,x2)#define test(x)#define showv(v)#define showv2(v)#define showvm(v)#define showvm2(v)#endifstruct edge{int from,to;ll cost;edge(int from_=0,int to_=0,ll cost_=0) : from(from_),to(to_),cost(cost_) {}bool operator<(const edge& ot){return cost < ot.cost;}};void solve(){int h,w,k,l,r; cin>>h>>w>>k>>l>>r;vector<vector<edge>> e(h*w);vs s(h);rep(i,h) cin>>s[i];vvi p(2,vi(h*w,-1));rep(i,h) rep(j,w){if (s[i][j] == '#') continue;rep(kk,4){int x,y;x = i + dx[kk];y = j + dy[kk];if (x <= h-1 && x >= 0 && y <= w-1 && y >= 0 && s[x][y]=='.'){e[i*w + j].pb(edge(i*w + j, x*w + y , 1));}}}int d1 = l-1;int d2 = (k-r);vvl dist(2 , vl(h*w,LINF));rep(i,2){mpq<pli> q;int st = (h*w-1)*i;dist[i][st] = 0;q.push({dist[i][st] , st});while(!q.empty()){pli pp = q.top();q.pop();ll nowDist = pp.first;int from = pp.second;if (dist[i][from] < nowDist) continue;fore(ey , e[from]){int to = ey.to;ll cost = ey.cost;if (chmin(dist[i][to] , nowDist + cost)){p[i][to] = from;q.push({dist[i][to] , to});}}}}bool ok = false;string ans;rep(i,h) rep(j,w){int f = i*w + j;if (ans != "") continue;if (dist[0][f] > d1) continue;if (dist[1][f] > d2) continue;if (dist[0][f]%2 != d1%2) continue;if (dist[1][f]%2 != d2%2) continue;if ((r-l+1)%2==1) continue;rep(kk,2){if (ans!="") continue;int x,y,x2,y2;x = i + dx[kk];x2 = i + dx[kk+2];y = j + dy[kk];y2 = j + dy[kk+2];bool ok2 = true;if (!(x <= h-1 && x >= 0 && y <= w-1 && y >= 0 && s[x][y]=='.')) ok2 = false;if ((l!=r) && !(x2 <= h-1 && x2 >= 0 && y2 <= w-1 && y2 >= 0 && s[x2][y2]=='.')) ok2 = false;if (!ok2) continue;ok = true;int now = f;auto getChar = [&](int a,int b){char ret;if (abs(b-a)==1){if (b>a) ret = 'L';else ret = 'R';}else{if (b>a) ret = 'U';else ret = 'D';}return ret;};while(now!=0){int nxt = p[0][now];ans += getChar(now,nxt);swap(now,nxt);}string ss;if (kk==0) ss = "DU";else if(kk==1) ss = "RL";else if(kk==2) ss = "UD";else ss = "LR";reverse(rng(ans));int cnt = (r-l+1) + (d1 - dist[0][f]) + (d2 - dist[1][f]);cnt /= 2;rep(ii,cnt) ans += ss;now = f;while(now!=(h*w-1)){int nxt = p[1][now];ans += getChar(nxt,now);swap(now,nxt);}}}if (!ok){retval(No);}yes;out;return;}int main(){ios::sync_with_stdio(false);cin.tie(0);int t = 1;//cin>>t;rep(i,t){solve();}return 0;}