結果
問題 | No.20 砂漠のオアシス |
ユーザー | Ricky_pon |
提出日時 | 2020-05-19 10:37:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 15 ms / 5,000 ms |
コード長 | 2,298 bytes |
コンパイル時間 | 2,900 ms |
コンパイル使用メモリ | 198,164 KB |
最終ジャッジ日時 | 2025-01-10 13:02:51 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:38:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 38 | scanf("%d%d%d%d", &n, &V, &ox, &oy); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:42:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 42 | rep(i, n)rep(j, n) scanf("%d", &a[i][j]); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))#define rep(i, n) For((i), 0, (n))#define rrep(i, n) rFor((i), (n), 0)#define fi first#define se secondusing namespace std;typedef long long lint;typedef unsigned long long ulint;typedef pair<int, int> pii;typedef pair<lint, lint> pll;template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}template<class T> T div_floor(T a, T b){if(b < 0) a *= -1, b *= -1;return a>=0 ? a/b : (a+1)/b-1;}template<class T> T div_ceil(T a, T b){if(b < 0) a *= -1, b *= -1;return a>0 ? (a-1)/b+1 : a/b;}constexpr lint mod = 1e9+7;constexpr lint INF = mod * mod;constexpr int MAX = 200010;struct state{int hp, x, y; bool used;state(int h, int x, int y, bool u): hp(h), x(x), y(y), used(u){}};int dx[4] = {0, 1, 0, -1};int dy[4] = {1, 0, -1, 0};int main(){int n, V, ox, oy;scanf("%d%d%d%d", &n, &V, &ox, &oy);--ox; --oy;swap(ox, oy);int a[n][n];rep(i, n)rep(j, n) scanf("%d", &a[i][j]);int d[n][n][2];rep(i, n)rep(j, n)rep(k, 2) d[i][j][k] = -1;auto cmp = [](const state &s1, const state &s2){return s1.hp < s2.hp;};priority_queue<state, vector<state>, decltype(cmp)> que(cmp);que.emplace(V, 0, 0, false);d[0][0][0] = V;while(!que.empty()){auto s = que.top();que.pop();if(s.hp < d[s.x][s.y][s.used]) continue;rep(i, 4){int nx = s.x + dx[i], ny = s.y + dy[i];if(0<=nx && nx<n && 0<=ny && ny<n){if(nx == ox && ny == oy && !s.used){if(s.hp > a[nx][ny] && chmax(d[nx][ny][1], (s.hp-a[nx][ny]) * 2)){que.emplace(d[nx][ny][1], nx, ny, true);}}else{if(s.hp > a[nx][ny] && chmax(d[nx][ny][s.used], s.hp-a[nx][ny])){que.emplace(d[nx][ny][s.used], nx, ny, s.used);}}}}}puts(d[n-1][n-1][0] > 0 || d[n-1][n-1][1] > 0 ? "YES" : "NO");}