結果
問題 | No.20 砂漠のオアシス |
ユーザー | mai |
提出日時 | 2018-10-27 18:58:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 15 ms / 5,000 ms |
コード長 | 8,644 bytes |
コンパイル時間 | 2,848 ms |
コンパイル使用メモリ | 225,032 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-19 06:50:05 |
合計ジャッジ時間 | 3,557 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 3 ms
6,820 KB |
testcase_05 | AC | 15 ms
6,820 KB |
testcase_06 | AC | 14 ms
6,820 KB |
testcase_07 | AC | 14 ms
6,816 KB |
testcase_08 | AC | 8 ms
6,820 KB |
testcase_09 | AC | 14 ms
6,820 KB |
testcase_10 | AC | 1 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 2 ms
6,816 KB |
testcase_13 | AC | 3 ms
6,820 KB |
testcase_14 | AC | 3 ms
6,820 KB |
testcase_15 | AC | 3 ms
6,816 KB |
testcase_16 | AC | 4 ms
6,816 KB |
testcase_17 | AC | 3 ms
6,820 KB |
testcase_18 | AC | 4 ms
6,820 KB |
testcase_19 | AC | 5 ms
6,816 KB |
testcase_20 | AC | 2 ms
6,816 KB |
ソースコード
#pragma GCC optimize ("O3") #include "bits/stdc++.h" using namespace std; using ll = long long int; #define debugos clog #define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;} #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;} #define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;} #define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(cnt,l) for(remove_reference<remove_const<decltype(l)>::type>::type cnt=0;(cnt)<(l);++(cnt)) #define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt)) #define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt)) #define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt)) const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L; inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } } template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; } template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) { os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; } template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); } template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); } template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); } template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(code); } mt19937_64 randdev(8901016); template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); } template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); } template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); } #if defined(_WIN32) || defined(_WIN64) #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #elif defined(__GNUC__) #else #define getchar_unlocked getchar #define putchar_unlocked putchar #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) noexcept { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc < '0' || '9' < cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var * sign; } inline int c() noexcept { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); return *this; } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; class MaiPrinter { public: template<typename T> void output_integer(T var) noexcept { if (var == 0) { putchar_unlocked('0'); return; } if (var < 0) putchar_unlocked('-'), var = -var; char stack[32]; int stack_p = 0; while (var) stack[stack_p++] = '0' + (var % 10), var /= 10; while (stack_p) putchar_unlocked(stack[--stack_p]); } inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; } inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; } inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; } inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; } inline MaiPrinter& operator<<(const string& str) { const char* p = str.c_str(); const char* l = p + str.size(); while (p < l) putchar_unlocked(*p++); return *this; } template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; } }; } MaiScanner scanner; MaiPrinter printer; struct P { using T = int; T y, x; P(T _y = 0, T _x = 0) :y(_y), x(_x) {} inline bool operator == (P p) const { return y == p.y && x == p.x; } inline bool operator < (P p) const { return y == p.y ? x < p.x : y < p.y; } inline P operator+(P p) const { return P(y + p.y, x + p.x); } inline P operator-(P p) const { return P(y - p.y, x - p.x); } inline P operator+=(P p) { y += p.y; x += p.x; return *this; } inline P operator-=(P p) { y -= p.y; x -= p.x; return *this; } }; inline ostream& operator<<(ostream& os, P p) { os << '(' << p.y << ',' << p.x << ')'; return os; } const P FourMoving[] = { P(-1,0),P(0,1), P(1,0), P(0,-1) }; const P FiveMoving[] = { P(-1,0),P(0,1), P(1,0), P(0,-1), P(0,0) }; const P EightMoving[] = { P(-1,0),P(0,1), P(1,0), P(0,-1), P(-1,-1), P(-1,1), P(1,-1), P(1,1) }; template<typename T> // using T = int; struct F { int height, width; vector<T> data; F(int h = 1, int w = 1) :height(h), width(w), data(h*w) {} inline T& operator()(int y, int x) { return data[x + y * width]; } inline T& operator()(P p) { return data[p.x + p.y * width]; } inline T operator()(int y, int x) const { return data[x + y * width]; } inline T operator()(P p) const { return data[p.x + p.y * width]; } inline bool safe(int y, int x) const { return 0 <= y && y < height && 0 <= x && x < width; } inline bool safe(P p) const { return 0 <= p.y && p.y < height && 0 <= p.x && p.x < width; } inline void fill(T e) { std::fill(ALL(data), e); } inline void resize(int h, int w) { height = h; width = w; data.resize(h*w); } void print(ostream& os, int setw_arg = 4) { for (int y = 0; y < height; ++y) { for (int x = 0; x < width; ++x) os << setw(setw_arg) << operator()(y, x) << ' '; os << '\n'; } } }; /// <summary> /// 全てのセルに対してstartからの距離を求める /// </summary> /// <param name="height">gridの高さ</param> /// <param name="width">gridの幅</param> /// <param name="start">開始地点</param> /// <param name="costFunc">costFunc(curr, dest): 現在地点currから隣接点destに移動する時に掛かるコストを返す関数</param> /// <returns>開始地点からの最短距離</returns> F<ll> grid_tour(int height, int width, P start, function<ll(P, P)> costFunc) { priority_queue<pair<ll, P>> pque; F<ll> dist(height, width); dist.fill(numeric_limits<ll>::max()); pque.emplace(0, start); dist(start) = 0; while (!pque.empty()) { auto dx = pque.top(); pque.pop(); dx.first = -dx.first; for (auto y : FourMoving) { y += dx.second; if (!dist.safe(y)) continue; auto c = costFunc(dx.second, y); if (c >= 0 && dist(y) > dx.first + c) { dist(y) = dx.first + c; pque.emplace(-(dx.first + c), y); } } } return dist; } int N, V, Oy, Ox; int main() { scanner >> N >> V >> Ox >> Oy; --Oy, --Ox; F<int> field(N, N); repeat(i, N) repeat(j, N) scanner >> field(i, j); ll mujihi = field(N-1, N-1); auto dist = grid_tour(N, N, P(0, 0), [&](P from, P dest) {return field(dest); }); if (dist(N - 1, N - 1) < V) bye("YES"); if (dist(Oy, Ox) >= V || Oy == -1) bye("NO"); auto dist2 = grid_tour(N, N, P(Oy, Ox), [&](P from, P dest) {return field(dest); }); if (dist2(N - 1, N - 1) < (V - dist(Oy, Ox)) * 2) bye("YES"); bye("NO"); return 0; }