結果
問題 |
No.367 ナイトの転身
|
ユーザー |
|
提出日時 | 2022-06-28 20:27:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 66 ms / 2,000 ms |
コード長 | 3,836 bytes |
コンパイル時間 | 5,208 ms |
コンパイル使用メモリ | 262,856 KB |
最終ジャッジ日時 | 2025-01-30 01:23:19 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 27 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:88:34: warning: ‘gx’ may be used uninitialized [-Wmaybe-uninitialized] 88 | int ans=min(d[gx][gy][0],d[gx][gy][1]); | ^ main.cpp:57:15: note: ‘gx’ was declared here 57 | int sx,sy,gx,gy; | ^~ main.cpp:88:38: warning: ‘gy’ may be used uninitialized [-Wmaybe-uninitialized] 88 | int ans=min(d[gx][gy][0],d[gx][gy][1]); | ^ main.cpp:57:18: note: ‘gy’ was declared here 57 | int sx,sy,gx,gy; | ^~ main.cpp:63:9: warning: ‘sx’ may be used uninitialized [-Wmaybe-uninitialized] 63 | d[sx][sy][0]=0; | ^ main.cpp:57:9: note: ‘sx’ was declared here 57 | int sx,sy,gx,gy; | ^~ main.cpp:63:13: warning: ‘sy’ may be used uninitialized [-Wmaybe-uninitialized] 63 | d[sx][sy][0]=0; | ^ main.cpp:57:12: note: ‘sy’ was declared here 57 | int sx,sy,gx,gy; | ^~
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() #define ALLR(v) (v).rbegin(),(v).rend() #define fi first #define se second #define PB push_back #define EB emplace_back template<typename T> using PQ = priority_queue<T>; template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>; template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}}; template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];}; template<typename T>void debug(const vector<T>&v){debug(v,v.size());} template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());} template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;} template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;} template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;} template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;} template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;} void foo() {cerr << endl;} template <class Head, class... Tail>void foo(Head&& head, Tail&&... tail){cerr << head << " ";foo(move(tail)...);} 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; } int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; const ll INF=1LL<<60; const int inf=(1<<30)-1; // const int mod=1e9+7; const int mod=998244353; int dx[8]={-2,-2,-1,-1,1,1,2,2}; int dy[8]={-1,1,-2,2,-2,2,-1,1}; int x[4]={-1,-1,1,1}; int y[4]={-1,1,-1,1}; using mint=modint998244353; // using mint=modint1000000007; int main(){ cin.tie(0); ios::sync_with_stdio(false); int h,w;cin >> h >> w; vector<string> s(h); REP(i,h) cin >> s[i]; int sx,sy,gx,gy; REP(i,h) REP(j,w){ if(s[i][j]=='S') sx=i,sy=j; if(s[i][j]=='G') gx=i,gy=j; } vector d(h,vector(w,vector<int>(2,inf))); d[sx][sy][0]=0; queue<tuple<int,int,int>> q; q.push({sx,sy,0}); while(!q.empty()){ auto [u,v,t]=q.front();q.pop(); // foo(u,v,t); if(t==0){ REP(i,8){ int nx=u+dx[i],ny=v+dy[i]; if(nx<0||nx>=h||ny<0||ny>=w) continue; if(chmin(d[nx][ny][s[nx][ny]=='R'],d[u][v][t]+1)){ q.push({nx,ny,s[nx][ny]=='R'}); } } } else{ REP(i,4){ int nx=u+x[i],ny=v+y[i]; if(nx<0||nx>=h||ny<0||ny>=w) continue; if(chmin(d[nx][ny][s[nx][ny]!='R'],d[u][v][t]+1)){ q.push({nx,ny,s[nx][ny]!='R'}); } } } } int ans=min(d[gx][gy][0],d[gx][gy][1]); cout << (ans==inf?-1:ans) << endl; }