結果
| 問題 | No.1599 Hikyaku |
| ユーザー |
 hirayuu_yc
|
| 提出日時 | 2024-09-20 11:17:40 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,012 ms / 7,500 ms |
| コード長 | 10,288 bytes |
| コンパイル時間 | 6,678 ms |
| コンパイル使用メモリ | 290,456 KB |
| 実行使用メモリ | 64,972 KB |
| 最終ジャッジ日時 | 2024-09-20 11:18:21 |
| 合計ジャッジ時間 | 35,494 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 49 |
ソースコード
#line 2 "Template/Template.hpp"#include <bits/stdc++.h>using namespace std;#line 8 "Template/InOut.hpp"inline void scan() {}inline void scan(int &a) { std::cin >> a; }inline void scan(unsigned &a) { std::cin >> a; }inline void scan(long &a) { std::cin >> a; }inline void scan(long long &a) { std::cin >> a; }inline void scan(unsigned long long &a) { std::cin >> a; }inline void scan(char &a) { std::cin >> a; }inline void scan(float &a) { std::cin >> a; }inline void scan(double &a) { std::cin >> a; }inline void scan(long double &a) { std::cin >> a; }inline void scan(std::vector<bool> &vec) {for (int32_t i = 0; i < vec.size(); i++) {int a;scan(a);vec[i] = a;}}inline void scan(std::string &a) { std::cin >> a; }template <class T>inline void scan(std::vector<T> &vec);template <class T, size_t size>inline void scan(std::array<T, size> &vec);template <class T, class L>inline void scan(std::pair<T, L> &p);template <class T, size_t size>inline void scan(T (&vec)[size]);template <class T>inline void scan(std::vector<T> &vec) {for (auto &i : vec) scan(i);}template <class T>inline void scan(std::deque<T> &vec) {for (auto &i : vec) scan(i);}template <class T, size_t size>inline void scan(std::array<T, size> &vec) {for (auto &i : vec) scan(i);}template <class T, class L>inline void scan(std::pair<T, L> &p) {scan(p.first);scan(p.second);}template <class T, size_t size>inline void scan(T (&vec)[size]) {for (auto &i : vec) scan(i);}template <class T>inline void scan(T &a) {std::cin >> a;}inline void in() {}template <class Head, class... Tail>inline void in(Head &head, Tail &...tail) {scan(head);in(tail...);}inline void print() { std::cout << ' '; }inline void print(const bool &a) { std::cout << a; }inline void print(const int &a) { std::cout << a; }inline void print(const unsigned &a) { std::cout << a; }inline void print(const long &a) { std::cout << a; }inline void print(const long long &a) { std::cout << a; }inline void print(const unsigned long long &a) { std::cout << a; }inline void print(const char &a) { std::cout << a; }inline void print(const char a[]) { std::cout << a; }inline void print(const float &a) { std::cout << a; }inline void print(const double &a) { std::cout << a; }inline void print(const long double &a) { std::cout << a; }inline void print(const std::string &a) {for (auto &&i : a) print(i);}template <class T>inline void print(const std::vector<T> &vec);template <class T, size_t size>inline void print(const std::array<T, size> &vec);template <class T, class L>inline void print(const std::pair<T, L> &p);template <class T, size_t size>inline void print(const T (&vec)[size]);template <class T>inline void print(const std::vector<T> &vec) {if (vec.empty()) return;print(vec[0]);for (auto i = vec.begin(); ++i != vec.end();) {std::cout << ' ';print(*i);}}template <class T>inline void print(const std::deque<T> &vec) {if (vec.empty()) return;print(vec[0]);for (auto i = vec.begin(); ++i != vec.end();) {std::cout << ' ';print(*i);}}template <class T, size_t size>inline void print(const std::array<T, size> &vec) {print(vec[0]);for (auto i = vec.begin(); ++i != vec.end();) {std::cout << ' ';print(*i);}}template <class T, class L>inline void print(const std::pair<T, L> &p) {print(p.first);std::cout << ' ';print(p.second);}template <class T, size_t size>inline void print(const T (&vec)[size]) {print(vec[0]);for (auto i = vec; ++i != end(vec);) {std::cout << ' ';print(*i);}}template <class T>inline void print(const T &a) {std::cout << a;}inline void out() { std::cout << '\n'; }template <class T>inline void out(const T &t) {print(t);std::cout << '\n';}template <class Head, class... Tail>inline void out(const Head &head, const Tail &...tail) {print(head);std::cout << ' ';out(tail...);}inline void Yes(bool i = true) { out(i ? "Yes" : "No"); }inline void No(bool i = true) { out(i ? "No" : "Yes"); }inline void Takahashi(bool i = true) { out(i ? "Takahashi" : "Aoki"); }inline void Aoki(bool i = true) { out(i ? "Aoki" : "Takahashi"); }inline void First(bool i = true) { out(i ? "First" : "Second"); }inline void Second(bool i = true) { out(i ? "Second" : "First"); }inline void Possible(bool i = true) { out(i ? "Possible" : "Impossible"); }inline void Impossible(bool i = true) { out(i ? "Impossible" : "Possible"); }inline void fls() { std::flush(std::cout); }struct IOsetup {IOsetup() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout << std::fixed << std::setprecision(16);}} iosetup;#line 8 "Template/Util.hpp"using ll = long long;using ld = double;using ull = unsigned long long;using uint = unsigned int;using pll = std::pair<ll, ll>;using pii = std::pair<int, int>;using vl = std::vector<ll>;using vvl = std::vector<std::vector<ll>>;using pdd = std::pair<ld, ld>;using tuplis = std::array<ll, 3>;template <class T>using pq = std::priority_queue<T, std::vector<T>, std::greater<T>>;constexpr ll LINF = (1LL << 62) - (1LL << 31);constexpr int32_t INF = INT_MAX >> 1;constexpr ll MINF = 1LL << 40;constexpr ld DINF = std::numeric_limits<ld>::infinity();constexpr int32_t MODD = 1000000007;constexpr int32_t MOD = 998244353;constexpr ld EPS = 1e-9;constexpr ld PI = 3.1415926535897932;const ll four[] = {0, 1, 0, -1, 0};const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;} elsereturn false;}template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;} elsereturn false;}template <class T>ll sum(const T &a) {return accumulate(std::begin(a), std::end(a), 0LL);}template <class T>ld dsum(const T &a) {return accumulate(std::begin(a), std::end(a), 0.0L);}template <class T>auto min(const T &a) {return *min_element(std::begin(a), std::end(a));}template <class T>auto max(const T &a) {return *max_element(std::begin(a), std::end(a));}#line 1 "Template/Macro.hpp"#define _overload3(_1, _2, _3, name, ...) name#define _overload4(_1, _2, _3, _4, name, ...) name#define _rep1(i, n) for (ll i = 0; i < (n); i++)#define _rep2(i, a, b) for (ll i = (a); i < (b); i++)#define _rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))#define rep(...) _overload4(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)#define _rrep1(i, n) for (ll i = (n) - 1; i >= 0; i--)#define _rrep2(i, a, b) for (ll i = (b) - 1; i >= (a); i--)#define rrep(...) _overload3(__VA_ARGS__, _rrep2, _rrep1)(__VA_ARGS__)#define each(i, ...) for (auto&& i : __VA_ARGS__)#define all(i) std::begin(i), std::end(i)#define rall(i) std::rbegin(i), std::rend(i)#define len(x) ((ll)(x).size())#define fi first#define se second#define uniq(x) x.erase(unique(all(x)), std::end(x))#define vec(type, name, ...) vector<type> name(__VA_ARGS__);#define vv(type, name, h, ...) std::vector<std::vector<type>> name(h, std::vector<type>(__VA_ARGS__));#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)#define LL(...) long long __VA_ARGS__; in(__VA_ARGS__)#define ULL(...) unsigned long long __VA_ARGS__; in(__VA_ARGS__)#define STR(...) std::string __VA_ARGS__; in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)#define LD(...) long double __VA_ARGS__; in(__VA_ARGS__)#define VEC(type, name, size) std::vector<type> name(size); in(name)#define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); in(name)#line 8 "Template/Template.hpp"constexpr ll H=600,W=600;constexpr ll speed=8;constexpr ld road=1000;int main(){LL(X,Y);LL(N);VEC(tuplis,mails,N);array<array<array<ld,W>,H>,speed> dist;array<array<array<ld,W>,H>,speed> dp;rep(i,speed){rep(j,H){rep(k,W){dist[i][j][k]=DINF;dp[i][j][k]=DINF;}}}X--;Y--;queue<tuplis> que;rep(i,N){mails[i][0]--;mails[i][1]--;dist[mails[i][2]][mails[i][0]][mails[i][1]]=0;que.push(mails[i]);}while(!que.empty()){ll sp=que.front()[2],x=que.front()[0],y=que.front()[1];que.pop();rep(i,4){ll nx=x+four[i],ny=y+four[i+1];if(nx<0||H<=nx||ny<0||W<=ny)continue;if(isinf(dist[sp][nx][ny])){dist[sp][nx][ny]=dist[sp][x][y]+road/sp;que.push({nx,ny,sp});}}}pq<pair<ld,tuplis>> vert;dp[mails[0][2]][mails[0][0]][mails[0][1]]=0;vert.push({0,mails[0]});while(!vert.empty()){ll sp=vert.top().se[2],x=vert.top().se[0],y=vert.top().se[1];ld dis=vert.top().fi;vert.pop();if(abs(dp[sp][x][y]-dis)>EPS)continue;rep(i,sp+1,speed){if(chmin(dp[i][x][y],max(dis,dist[i][x][y]))){vert.push({dp[i][x][y],{x,y,i}});}}rep(i,4){ll nx=x+four[i],ny=y+four[i+1];if(nx<0||H<=nx||ny<0||W<=ny)continue;if(chmin(dp[sp][nx][ny],dis+road/sp)){vert.push({dp[sp][nx][ny],{nx,ny,sp}});}array<ld,speed> meet;array<ld,speed> rest;fill(all(meet),DINF);meet[sp]=dis;rest[sp]=1000;rep(j,sp+1,speed){rep(k,sp,j){if(isinf(meet[k]))continue;if(meet[k]+rest[k]/sp<dist[j][nx][ny])continue;if(dist[j][nx][ny]+rest[k]/j<meet[k])continue;if(chmin(meet[j],(rest[k]+meet[k]*k+dist[j][nx][ny]*j)/(k+j)))rest[j]=(meet[j]-dist[j][nx][ny])*j;}if(chmin(dp[j][nx][ny],meet[j]*2-dist[j][nx][ny])){vert.push({dp[j][nx][ny],{nx,ny,j}});}}}}ld ans=DINF;rep(i,speed){chmin(ans,dp[i][X][Y]);}out(ans);}