結果
問題 | No.2805 Go to School |
ユーザー | aogera |
提出日時 | 2024-08-30 20:50:15 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 243 ms / 2,000 ms |
コード長 | 2,842 bytes |
コンパイル時間 | 7,894 ms |
コンパイル使用メモリ | 351,520 KB |
実行使用メモリ | 24,564 KB |
最終ジャッジ日時 | 2024-08-30 20:50:28 |
合計ジャッジ時間 | 12,565 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 76 ms
16,744 KB |
testcase_05 | AC | 97 ms
14,052 KB |
testcase_06 | AC | 56 ms
9,156 KB |
testcase_07 | AC | 47 ms
9,152 KB |
testcase_08 | AC | 77 ms
14,424 KB |
testcase_09 | AC | 56 ms
9,324 KB |
testcase_10 | AC | 49 ms
9,060 KB |
testcase_11 | AC | 243 ms
21,124 KB |
testcase_12 | AC | 132 ms
14,648 KB |
testcase_13 | AC | 195 ms
18,484 KB |
testcase_14 | AC | 27 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 81 ms
11,480 KB |
testcase_19 | AC | 57 ms
8,924 KB |
testcase_20 | AC | 132 ms
15,660 KB |
testcase_21 | AC | 211 ms
20,296 KB |
testcase_22 | AC | 79 ms
10,976 KB |
testcase_23 | AC | 128 ms
14,616 KB |
testcase_24 | AC | 128 ms
14,556 KB |
testcase_25 | AC | 36 ms
8,576 KB |
testcase_26 | AC | 158 ms
24,564 KB |
testcase_27 | AC | 74 ms
16,508 KB |
testcase_28 | AC | 8 ms
6,944 KB |
testcase_29 | AC | 13 ms
7,808 KB |
testcase_30 | AC | 41 ms
12,552 KB |
testcase_31 | AC | 63 ms
10,112 KB |
testcase_32 | AC | 108 ms
18,756 KB |
testcase_33 | AC | 157 ms
18,760 KB |
testcase_34 | AC | 2 ms
6,944 KB |
testcase_35 | AC | 2 ms
6,944 KB |
testcase_36 | AC | 62 ms
9,060 KB |
testcase_37 | AC | 76 ms
10,240 KB |
testcase_38 | AC | 156 ms
15,496 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> #include <atcoder/all> using ull = unsigned long long; using namespace std; using namespace atcoder; using vst = vector<string>; using ll = long long; using ld = long double; using P = pair<ll,ll>; using vl = vector<ll>; using vvl = vector<vl>; using vP = vector<P>; #define rep(i, n) for (ll i = 0; i < n; i++) #define repp(i,k,n) for (ll i = k; i < n; i++) #define per(i,s,e) for(ll i = s; i >= e; i--) #define all(v) v.begin(),v.end() #define yesno(a) a ? cout << "Yes" << '\n' : cout << "No" << '\n' #define YESNO(a) a ? cout << "YES" << '\n' : cout << "NO" << '\n' #define UNOmap unordered_map #define UNOset unordered_set #define chmax(a,b) a=max(a,b) #define chmin(a,b) a=min(a,b) #define debug(x) cerr << #x << " = " << x << '\n' template<class... T>void in(T&... a){(cin >> ... >> a);} template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << '\n';} template<class T> void vin2(vector<T> &u,vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++) in(u[i],v[i]);} template<class T> void vin(vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++)in(v[i]);} template<class T> void vout(vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i] << ' ';cout << "\n";} ll INF = 1152921504606846976;ll MOD =998244353; ll MOD1 =1000000007; /* INF = 1LL << 60 */ #define sl(...) ll __VA_ARGS__; in(__VA_ARGS__) using mint = modint998244353; using mint1 = modint1000000007; using mintn = modint; using vm = vector<mint>; using vvm = vector<vm>; vl dx = {0,0,1,-1}, dy = {1,-1,0,0}; //---------------------------------------------- int main(){ ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15); //============================================== ll N,M,L,S,E; in(N,M,L,S,E); vector<vector<P>> G(N); rep(i,M){ ll a,b,t; in(a,b,t); a--;b--; G[a].push_back(pair(t,b)); G[b].push_back(pair(t,a)); } vl T(L); vin(T); ll ans = INF; auto dijkstra = [&](ll start){ vl dist(N,INF); priority_queue<P,vector<P>,greater<P>> pq; pq.push({0,start}); dist[start] = 0; while(pq.size()){ auto[cost,v] = pq.top(); pq.pop(); if(cost != dist[v]) continue; for(auto [nc,nv] : G[v]){ if(dist[v] + nc < dist[nv]){ dist[nv] = dist[v] + nc; pq.push({dist[nv],nv}); } } } return dist; }; vl dist = dijkstra(0); vl tg = dijkstra(N-1); rep(i,L){ ll cur = 0; cur += dist[T[i]-1]; chmax(cur,S); if(cur >= S + E) continue; cur++; cur += tg[T[i]-1]; chmin(ans,cur); } if(ans == INF){ out(-1); return 0; } out(ans); }