結果
問題 | No.2805 Go to School |
ユーザー |
![]() |
提出日時 | 2024-07-12 21:21:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 239 ms / 2,000 ms |
コード長 | 6,685 bytes |
コンパイル時間 | 2,525 ms |
コンパイル使用メモリ | 224,616 KB |
実行使用メモリ | 24,460 KB |
最終ジャッジ日時 | 2024-07-16 01:37:23 |
合計ジャッジ時間 | 7,431 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 84 ms
17,920 KB |
testcase_05 | AC | 106 ms
14,344 KB |
testcase_06 | AC | 62 ms
9,600 KB |
testcase_07 | AC | 51 ms
9,472 KB |
testcase_08 | AC | 84 ms
14,592 KB |
testcase_09 | AC | 64 ms
9,088 KB |
testcase_10 | AC | 49 ms
9,088 KB |
testcase_11 | AC | 210 ms
21,740 KB |
testcase_12 | AC | 120 ms
14,776 KB |
testcase_13 | AC | 181 ms
18,920 KB |
testcase_14 | AC | 23 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 91 ms
11,776 KB |
testcase_19 | AC | 63 ms
8,912 KB |
testcase_20 | AC | 146 ms
16,328 KB |
testcase_21 | AC | 239 ms
21,500 KB |
testcase_22 | AC | 94 ms
11,596 KB |
testcase_23 | AC | 140 ms
15,616 KB |
testcase_24 | AC | 143 ms
15,652 KB |
testcase_25 | AC | 43 ms
9,176 KB |
testcase_26 | AC | 179 ms
24,460 KB |
testcase_27 | AC | 98 ms
18,504 KB |
testcase_28 | AC | 10 ms
7,680 KB |
testcase_29 | AC | 14 ms
8,576 KB |
testcase_30 | AC | 46 ms
13,956 KB |
testcase_31 | AC | 92 ms
11,008 KB |
testcase_32 | AC | 121 ms
23,644 KB |
testcase_33 | AC | 182 ms
20,288 KB |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 71 ms
9,792 KB |
testcase_37 | AC | 74 ms
11,008 KB |
testcase_38 | AC | 133 ms
16,896 KB |
ソースコード
#line 1 "test.cpp" #include<bits/stdc++.h> //#pragma GCC target("avx,avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #ifdef LOCAL #include <debug.hpp> #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast<void>(0)) #endif using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll,ll>; using pii = pair<int,int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vul = vector<ull>; using vpii = vector<pii>; using vvpii = vector<vpii>; using vpll = vector<pll>; using vs = vector<string>; template<class T> using pq = priority_queue<T,vector<T>, greater<T>>; #define overload4(_1, _2, _3, _4, name, ...) name #define overload3(a,b,c,name,...) name #define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER) #define rep2(i, n) for (ll i = 0; i < (n); ++i) #define rep3(i, a, b) for (ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i = (n) - 1;i >= 0;i--) #define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--) #define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--) #define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all1(i) begin(i) , end(i) #define all2(i,a) begin(i) , begin(i) + a #define all3(i,a,b) begin(i) + a , begin(i) + b #define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> auto min(const T& a){return *min_element(all(a));} template<class T> auto max(const T& a){return *max_element(all(a));} template<class... Ts> void in(Ts&... t); #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__) #define LD(...) ld __VA_ARGS__; in(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;} ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;} void Yes() {cout << "Yes\n";return;} void No() {cout << "No\n";return;} void YES() {cout << "YES\n";return;} void NO() {cout << "NO\n";return;} template <typename T> T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);} template <typename T> T ceil(T x, T y) {return floor(x + y - 1, y);} template <typename T> T bmod(T x, T y) {return x - y * floor(x, y);} template <typename T> pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};} namespace IO{ #define VOID(a) decltype(void(a)) struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting; template<int I> struct P : P<I-1>{}; template<> struct P<0>{}; template<class T> void i(T& t){ i(t, P<3>{}); } void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; } template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; } template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); } template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);} template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} #undef VOID } #define unpack(a) (void)initializer_list<int>{(a, 0)...} template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); } #undef unpack constexpr long double PI = 3.141592653589793238462643383279L; template <class F> struct REC { F f; REC(F &&f_) : f(forward<F>(f_)) {} template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }}; constexpr int mod = 998244353; //constexpr int mod = 1000000007; #line 2 "library/graph/graph-template.hpp" template <typename T> struct Edge { int from, to; T cost; Edge() = default; Edge(int _to, T _cost) : from(-1), to(_to), cost(_cost) {} Edge(int _from, int _to, T _cost) : from(_from), to(_to), cost(_cost) {} bool operator < (const Edge &a) const { return cost < a.cost; } bool operator > (const Edge &a) const { return cost > a.cost; } Edge &operator = (const int &x) { to = x; return *this; } operator int() const { return to; } friend ostream operator<<(ostream &os, Edge &edge) { return os << edge.to; } }; template <typename T> using Edges = vector<Edge<T>>; template <typename T> using Wgraph = vector<Edges<T>>; using Ugraph = vector<vector<int>>; Ugraph uinput(int N, int M = -1, bool is_directed = false, int origin = 1) { Ugraph g(N); if (M == -1) M = N - 1; while(M--) { int a,b; cin >> a >> b; a -= origin, b -= origin; g[a].push_back(b); if(!is_directed) g[b].push_back(a); } return g; } template <typename T> Wgraph<T> winput(int N, int M = -1, bool is_directed = false,int origin = 1) { Wgraph<T> g(N); if (M == -1) M = N - 1; while(M--) { int a,b; T c; cin >> a >> b >> c; a -= origin, b -= origin; g[a].emplace_back(b,c); if(!is_directed) g[b].emplace_back(a,c); } return g; } #line 100 "test.cpp" int main() { INT(n,m,l,s,e); auto g = winput<ll>(n,m); VEC(int,t,l); vi toi(n); rep(i,l) toi[t[i] - 1] = 1; vvl dist(2,vl(n,1e18)); dist[0][0] = 0; pq<tuple<ll,int,int>> q; q.emplace(0,0,0); while(!q.empty()) { auto [cost,p,now] = q.top(); q.pop(); if(dist[p][now] != cost) continue; if(p == 0 && toi[now] == 1 && cost < s + e) { if(chmin(dist[1][now],max(cost,(ll)s) + 1)) q.emplace(dist[1][now],1,now); } for(auto &nex:g[now]) { if(chmin(dist[p][nex],cost + nex.cost)) q.emplace(dist[p][nex],p,nex); } } if(dist[1][n-1] == (ll)1e18) cout << -1 << '\n'; else cout << dist[1][n-1] << '\n'; }