結果
問題 | No.20 砂漠のオアシス |
ユーザー | komori3 |
提出日時 | 2018-03-13 01:13:33 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 52 ms / 5,000 ms |
コード長 | 5,366 bytes |
コンパイル時間 | 1,507 ms |
コンパイル使用メモリ | 175,360 KB |
実行使用メモリ | 9,088 KB |
最終ジャッジ日時 | 2024-11-15 22:15:06 |
合計ジャッジ時間 | 2,555 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#define _CRT_SECURE_NO_WARNINGS#include "bits/stdc++.h"#include <random>using namespace std;//呪文#define DUMPOUT cerr#define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__)typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second <<"}"; return ostr; }template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; }ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s);ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}"; return ostr; }template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }namespace aux { // print tupletemplate<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };}template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }void dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; }else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }#define PI 3.14159265358979323846#define EPS 1e-11#define FOR(i,a,b) for(int i=(a);i<(b);++i)#define REP(i,n) FOR(i,0,n)#define all(x) (x).begin(), (x).end()#define SZ(x) ((int)(x).size())#define fake falsetemplate<typename T> using State = pair<T, int>;template<typename T> using Queue = priority_queue<State<T>, vector<State<T>>, greater<State<T>>>;template<typename T> vector<T> dijkstra(vector<vector<State<T>>> G, int s) {vector<T> dist(G.size(), T(1) << 28);vector<bool> used(G.size(), false);Queue<T> q;q.push(State<T>(T(0), s));//q.emplace(T(0), s);while (!q.empty()) {T c; int pos;tie(c, pos) = q.top(); q.pop();if (used[pos]) continue;used[pos] = true; dist[pos] = c;for (State<T> e : G[pos]) {if (dist[e.second] <= c + e.first) continue;q.push(State<T>(c + e.first, e.second));}}return dist;}int main(){//clock_t start, end;//start = clock();cin.tie(0);ios::sync_with_stdio(false);int N, V, Ox, Oy;cin >> N >> V >> Ox >> Oy;bool oasis = (Ox == 0 && Oy == 0 ? false : true);Ox--; Oy--;vector<vector<int>> L(N, vector<int>(N));cin >> L;vector<vector<pii>> G(N * N);for (int i = 0; i < N - 1; i++) {int v, ni, nj, nv;for (int j = 0; j < N - 1; j++) {v = i * N + j;ni = i; nj = j + 1;nv = ni * N + nj;G[v].push_back(pii(L[ni][nj], nv));G[nv].push_back(pii(L[i][j], v));ni = i + 1; nj = j;nv = ni * N + nj;G[v].push_back(pii(L[ni][nj], nv));G[nv].push_back(pii(L[i][j], v));}v = i * N + N - 1;nv = (i + 1) * N + N - 1;G[v].push_back(pii(L[i + 1][N - 1], nv));G[nv].push_back(pii(L[i][N - 1], v));v = (N - 1) * N + i;nv = (N - 1) * N + i + 1;G[v].push_back(pii(L[N - 1][i + 1], nv));G[nv].push_back(pii(L[N - 1][i], v));}int s_to_g, s_to_o, o_to_g;s_to_g = dijkstra<int>(G, 0)[N * N - 1];if (oasis) {s_to_o = dijkstra<int>(G, 0)[Oy * N + Ox];o_to_g = dijkstra<int>(G, Oy * N + Ox)[N * N - 1];}if (s_to_g < V) cout << "YES" << endl;else if (oasis && V - s_to_o > 0 && (V - s_to_o) * 2 > o_to_g) cout << "YES" << endl;else cout << "NO" << endl;//end = clock();//printf("%d msec.\n", end - start);return 0;}