結果
| 問題 | No.1599 Hikyaku |
| ユーザー |
 mtsd
|
| 提出日時 | 2021-07-09 22:42:34 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,955 bytes |
| コンパイル時間 | 1,912 ms |
| コンパイル使用メモリ | 183,888 KB |
| 実行使用メモリ | 62,508 KB |
| 最終ジャッジ日時 | 2023-09-14 10:22:31 |
| 合計ジャッジ時間 | 49,587 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 141 ms
48,896 KB |
| testcase_01 | AC | 297 ms
54,656 KB |
| testcase_02 | AC | 298 ms
55,840 KB |
| testcase_03 | AC | 393 ms
48,952 KB |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 1,781 ms
60,668 KB |
| testcase_09 | AC | 1,213 ms
54,676 KB |
| testcase_10 | WA | - |
| testcase_11 | AC | 1,047 ms
48,796 KB |
| testcase_12 | WA | - |
| testcase_13 | AC | 354 ms
48,828 KB |
| testcase_14 | AC | 215 ms
48,920 KB |
| testcase_15 | AC | 87 ms
48,708 KB |
| testcase_16 | AC | 509 ms
48,740 KB |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | AC | 1,511 ms
48,872 KB |
| testcase_26 | WA | - |
| testcase_27 | AC | 762 ms
48,988 KB |
| testcase_28 | WA | - |
| testcase_29 | AC | 579 ms
48,936 KB |
| testcase_30 | WA | - |
| testcase_31 | AC | 85 ms
48,740 KB |
| testcase_32 | AC | 84 ms
48,712 KB |
| testcase_33 | AC | 176 ms
48,784 KB |
| testcase_34 | AC | 749 ms
48,924 KB |
| testcase_35 | AC | 976 ms
48,740 KB |
| testcase_36 | AC | 1,440 ms
48,828 KB |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | AC | 84 ms
48,844 KB |
| testcase_42 | AC | 85 ms
48,648 KB |
| testcase_43 | AC | 85 ms
48,732 KB |
| testcase_44 | WA | - |
| testcase_45 | AC | 358 ms
48,808 KB |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | AC | 84 ms
48,836 KB |
| testcase_50 | AC | 226 ms
48,960 KB |
| testcase_51 | AC | 361 ms
48,856 KB |
| testcase_52 | AC | 975 ms
48,820 KB |
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:206:14: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ [-Wc++17-extensions]
206 | auto [cost,x,y,v,s] = pq.top();
| ^
ソースコード
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
os << "{";
for (int i = 0; i<(int)vec.size(); i++) {
os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "{";
for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
os << "{";
for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
os << (*itr);
++itr;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}
template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x + y - 1) / y);}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto e : a) v.emplace_back(e);
fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto &&e : a) e = lb(v, e);
renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
vector<S> v;
fold_in(v, head, args...);
sort(all(v)), v.erase(unique(all(v)), v.end());
renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
double d[601][601][8][2];
bool check(int a,int b){
if(a<0||a>=601||b<0||b>=601)return false;
return true;
}
int main(){
INT(X,Y);
INT(n);
Fill(d,1e60);
priority_queue<tuple<double,int,int,int,int>,vector<tuple<double,int,int,int,int>>,greater<tuple<double,int,int,int,int>>>pq;
rep(i,n){
INT(x,y,v);
if(i==0){
d[x][y][v][1] = 0;
pq.push(MT(0,x,y,v,1));
}else{
d[x][y][v][0] = 0;
pq.push(MT(0,x,y,v,0));
}
}
double eps = 1e-10;
while(!pq.empty()){
auto [cost,x,y,v,s] = pq.top();
if(x<=5&&y<=5)dbg(cost,x,y,v,s);
pq.pop();
if(d[x][y][v][s]< cost - 1e-10)continue;
rep(dir,4){
int nx = x + dx[dir];
int ny = y + dy[dir];
if(!check(nx,ny))continue;
double ncost = cost+1000.0/(double)(v);
if(d[nx][ny][v][s] > ncost + eps){
d[nx][ny][v][s] = ncost;
pq.push(MT(ncost,nx,ny,v,s));
}
}
if(s==0){
bool g = 0;
rep(nv,v){
if(d[x][y][nv][1] < cost){
if(d[x][y][v][1] > cost + eps){
d[x][y][v][1] = cost;
pq.push(MT(cost,x,y,v,1));
g = 1;
}
}
}
if(g)continue;
rep(dir,4){
int nx = x + dx[dir];
int ny = y + dy[dir];
if(!check(nx,ny))continue;
rep(nv,v){
if(d[nx][ny][nv][1] <= cost+eps){
double len = 1000.0 - (double)nv * (cost-d[nx][ny][nv][1]);
if(len<0)continue;
double T1 = len/(double)(nv+v);
double La = T1*v;
double Lb = T1*nv + (1000.0)-len;
// modoru
double ncost = T1 + La/(double)v + cost;
if(d[x][y][v][1]> ncost-eps){
d[x][y][v][1] = ncost;
pq.push(MT(ncost,x,y,v,1));
}
// susumu
ncost = T1 + Lb/(double)v + cost;
if(d[nx][ny][v][1]> ncost-eps){
d[nx][ny][v][1] = ncost;
pq.push(MT(ncost,nx,ny,v,1));
}
}
}
}
}
}
double mi = inf;
rep(v,8){
chmin(mi,d[X][Y][v][1]);
}
cout << fixed << setprecision(20) << mi << endl;
return 0;
}