結果
問題 | No.1638 Robot Maze |
ユーザー | suta28407928 |
提出日時 | 2021-08-06 21:31:39 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 3,496 bytes |
コンパイル時間 | 2,668 ms |
コンパイル使用メモリ | 198,640 KB |
実行使用メモリ | 4,348 KB |
最終ジャッジ日時 | 2023-10-17 02:49:37 |
合計ジャッジ時間 | 4,204 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 3 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 2 ms
4,348 KB |
testcase_12 | AC | 1 ms
4,348 KB |
testcase_13 | AC | 1 ms
4,348 KB |
testcase_14 | AC | 3 ms
4,348 KB |
testcase_15 | AC | 2 ms
4,348 KB |
testcase_16 | AC | 2 ms
4,348 KB |
testcase_17 | AC | 2 ms
4,348 KB |
testcase_18 | AC | 2 ms
4,348 KB |
testcase_19 | AC | 2 ms
4,348 KB |
testcase_20 | AC | 2 ms
4,348 KB |
testcase_21 | AC | 2 ms
4,348 KB |
testcase_22 | AC | 2 ms
4,348 KB |
testcase_23 | AC | 2 ms
4,348 KB |
testcase_24 | AC | 2 ms
4,348 KB |
testcase_25 | AC | 2 ms
4,348 KB |
testcase_26 | AC | 2 ms
4,348 KB |
testcase_27 | AC | 2 ms
4,348 KB |
testcase_28 | AC | 2 ms
4,348 KB |
testcase_29 | AC | 2 ms
4,348 KB |
testcase_30 | AC | 1 ms
4,348 KB |
testcase_31 | AC | 2 ms
4,348 KB |
testcase_32 | AC | 3 ms
4,348 KB |
testcase_33 | AC | 3 ms
4,348 KB |
testcase_34 | AC | 3 ms
4,348 KB |
testcase_35 | AC | 3 ms
4,348 KB |
testcase_36 | AC | 3 ms
4,348 KB |
testcase_37 | AC | 3 ms
4,348 KB |
testcase_38 | AC | 3 ms
4,348 KB |
testcase_39 | AC | 3 ms
4,348 KB |
testcase_40 | AC | 3 ms
4,348 KB |
testcase_41 | AC | 3 ms
4,348 KB |
testcase_42 | AC | 3 ms
4,348 KB |
testcase_43 | AC | 4 ms
4,348 KB |
testcase_44 | AC | 4 ms
4,348 KB |
testcase_45 | AC | 3 ms
4,348 KB |
testcase_46 | AC | 3 ms
4,348 KB |
testcase_47 | AC | 3 ms
4,348 KB |
testcase_48 | AC | 4 ms
4,348 KB |
testcase_49 | AC | 3 ms
4,348 KB |
testcase_50 | AC | 3 ms
4,348 KB |
testcase_51 | AC | 3 ms
4,348 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; #define DEBUG #ifdef DEBUG template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template <class T, class... Args> void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = (1<<30)-1; const ll linf = 1LL<<61; const int MAX = 510000; //int dy[8] = {0,1,0,-1,1,-1,-1,1}; //int dx[8] = {-1,0,1,0,1,-1,1,-1}; const double pi = acos(-1); const double eps = 1e-8; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ int sz = a.size(); for(auto itr = a.begin(); itr != a.end(); itr++){ cout << *itr; sz--; if(sz) cout << " "; } cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){ cout << a << " " << b << "\n"; } template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } void mark() {cout << "#" << "\n";} ll pcount(ll x) {return __builtin_popcountll(x);} //const int mod = 1e9 + 7; const int mod = 998244353; int dy[4] = {-1,1,0,0}; int dx[4] = {0,0,1,-1}; bool in(ll y, ll x, ll h, ll w){ return 0 <= y && y < h && 0 <= x && x < w; } ll dp[105][105]; int main(){ int h,w; cin >> h >> w; vl e(4); rep(i,4) cin >> e[i]; ll k,p; cin >> k >> p; int a,b,c,d; cin >> a >> b >> c >> d; a--; b--; c--; d--; vs s(h); rep(i,h) cin >> s[i]; rep(i,h) rep(j,w) dp[i][j] = linf; dp[a][b] = 0; priority_queue<tapu,vector<tapu>,greater<tapu>> pq; pq.emplace(0,a,b); while(!pq.empty()){ ll co,y,x; tie(co,y,x) = pq.top(); pq.pop(); if(dp[y][x] < co) continue; rep(i,4){ int ny = y + dy[i]; int nx = x + dx[i]; if(!in(ny,nx,h,w) || s[ny][nx] == '#') continue; ll nc = co + e[i]; if(s[ny][nx] == '@') nc += p; if(chmin(dp[ny][nx], nc)) pq.emplace(nc,ny,nx); } } if(dp[c][d] <= k) cout << "Yes\n"; else cout << "No\n"; }