結果
| 問題 | No.20 砂漠のオアシス |
| ユーザー |
 Shuz*
|
| 提出日時 | 2021-12-19 17:24:27 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 11,838 bytes |
| コンパイル時間 | 2,018 ms |
| コンパイル使用メモリ | 183,772 KB |
| 実行使用メモリ | 8,164 KB |
| 最終ジャッジ日時 | 2023-10-13 18:54:38 |
| 合計ジャッジ時間 | 3,394 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,348 KB |
| testcase_01 | AC | 2 ms
4,352 KB |
| testcase_02 | AC | 2 ms
4,348 KB |
| testcase_03 | AC | 3 ms
4,352 KB |
| testcase_04 | AC | 4 ms
4,352 KB |
| testcase_05 | AC | 37 ms
8,096 KB |
| testcase_06 | AC | 45 ms
8,052 KB |
| testcase_07 | AC | 45 ms
7,892 KB |
| testcase_08 | AC | 44 ms
7,860 KB |
| testcase_09 | AC | 45 ms
8,164 KB |
| testcase_10 | WA | - |
| testcase_11 | AC | 2 ms
4,348 KB |
| testcase_12 | WA | - |
| testcase_13 | AC | 3 ms
4,348 KB |
| testcase_14 | AC | 4 ms
4,352 KB |
| testcase_15 | AC | 4 ms
4,348 KB |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | AC | 9 ms
4,492 KB |
| testcase_20 | AC | 3 ms
4,348 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC target("arch=skylake-avx512")
// #include <atcoder/all>
// using namespace atcoder;
// #define NDEBUG
#pragma region template
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll) (n) -1 ? rt : sp)
#define len(x) ((ll) (x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll) (lower_bound(all(x), y) - (x).begin()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb(b);
if (__DIRECTED__ == false) g[b].pb(a);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb({b, c});
if (__DIRECTED__ == false) g[b].pb({a, c});
return is;
}
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 (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#ifdef NDEBUG
#define debug(...)
#define dumpi(a, h, w)
#define vdumpi(a, n)
#define dump(a, h, w)
#define vdump(a, n)
#else
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \
cerr << rt; \
}
#define dumpi(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
if (__i) cerr << ",\n"; \
cerr << "["; \
rep(__j, w) { \
if (__j) cerr << ", "; \
if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \
if (abs(a[__i][__j]) >= INF / 2) cerr << "∞"; \
else \
cerr << a[__i][__j]; \
} \
cerr << "]"; \
} \
cerr << "\n]" << rt; \
}
#define vdumpi(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << ", "; \
if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \
if (abs(a[__i]) >= INF / 2) cerr << "∞"; \
else \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
if (__i) cerr << ",\n"; \
cerr << "["; \
rep(__j, w) { \
if (__j) cerr << ", "; \
cerr << a[__i][__j]; \
} \
cerr << "]"; \
} \
cerr << "\n]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << ", "; \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
#endif
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
is >> p.first >> p.second;
return is;
}
template <class S, class T> ostream &operator<<(ostream &os, const pair<S, T> &p) {
os << p.first << ' ' << p.second;
return os;
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")
// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
unsigned long long binary_gcd(unsigned long long x, unsigned long long y) {
if (!x | !y) return x | y;
unsigned long long cx = __builtin_ctzll(x), cy = __builtin_ctzll(y);
x >>= cx, y >>= cy;
while (x ^ y) {
if (x > y) {
x = (x - y) >> __builtin_ctzll(x ^ y);
} else {
y = (y - x) >> __builtin_ctzll(x ^ y);
}
}
return x << min(cx, cy);
}
inline long long binary_gcd(long long x, long long y) {
return binary_gcd((unsigned long long) (abs(x)), (unsigned long long) (abs(y)));
}
#define codeforces \
ll testcases; \
cin >> testcases; \
rep(testcase, testcases)
#define gcj(s) cout << s << testcase + 1 << ": "
#pragma endregion
template <typename T = ll> struct Dijkstra {
ll V;
using P = pair<ll, T>;
using P2 = pair<T, ll>;
vector<vector<P>> G;
vector<T> dist;
vector<bool> used;
Dijkstra(ll v) : V(v), G(v), dist(v), used(v) {}
void setDist(ll a, ll b, T d, ll indexed = 0, bool reverse = 0) {
a -= indexed, b -= indexed;
G[a].push_back(P(b, d));
if (reverse) G[b].push_back(P(a, d));
}
void calc(ll s = 0) {
priority_queue<P2, vector<P2>, greater<P2>> Q;
Q.push(P2(0, s));
fill_n(dist.begin(), V, INF);
fill_n(used.begin(), V, false);
while (!Q.empty()) {
T d;
ll t;
tie(d, t) = Q.top(), Q.pop();
if (used[t]) continue;
used[t] = true, dist[t] = d;
for (P e : G[t]) {
if (dist[e.first] <= d + e.second) continue;
Q.push(P2(d + e.second, e.first));
}
}
}
};
signed main() {
ll N, V, X, Y;
cin >> N >> V >> X >> Y;
ll L[N][N];
Dijkstra<ll> d(N * N);
rep(i, N) rep(j, N) cin >> L[i][j];
rep(i, N) rep(j, N) {
if (i) {
d.setDist((i - 1) * N + j, i * N + j, L[i][j]);
d.setDist(i * N + j, (i - 1) * N + j, L[i - 1][j]);
}
if (j) {
d.setDist(i * N + j - 1, i * N + j, L[i][j]);
d.setDist(i * N + j, i * N + j - 1, L[i][j - 1]);
}
}
d.calc(0);
ll ans = V - d.dist[N * N - 1] > 0;
if (X) {
ll d1 = d.dist[(X - 1) * N + Y - 1];
d.calc((X - 1) * N + Y - 1);
ll d2 = d.dist[N * N - 1];
ans |= V - d1 > 0 && (V - d1) * 2 - d2 > 0;
}
cout << (ans ? "YES" : "NO") << endl;
}