結果
問題 | No.2805 Go to School |
ユーザー | 👑 binap |
提出日時 | 2024-07-12 22:29:16 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 466 ms / 2,000 ms |
コード長 | 4,469 bytes |
コンパイル時間 | 5,263 ms |
コンパイル使用メモリ | 284,820 KB |
実行使用メモリ | 27,528 KB |
最終ジャッジ日時 | 2024-07-16 01:40:55 |
合計ジャッジ時間 | 12,935 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 202 ms
18,624 KB |
testcase_05 | AC | 329 ms
21,028 KB |
testcase_06 | AC | 147 ms
10,344 KB |
testcase_07 | AC | 157 ms
11,520 KB |
testcase_08 | AC | 300 ms
20,644 KB |
testcase_09 | AC | 161 ms
11,360 KB |
testcase_10 | AC | 181 ms
12,120 KB |
testcase_11 | AC | 466 ms
25,016 KB |
testcase_12 | AC | 290 ms
16,340 KB |
testcase_13 | AC | 419 ms
22,844 KB |
testcase_14 | AC | 52 ms
6,940 KB |
testcase_15 | AC | 3 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 221 ms
13,500 KB |
testcase_19 | AC | 125 ms
9,548 KB |
testcase_20 | AC | 343 ms
19,296 KB |
testcase_21 | AC | 393 ms
24,616 KB |
testcase_22 | AC | 174 ms
12,188 KB |
testcase_23 | AC | 291 ms
16,156 KB |
testcase_24 | AC | 292 ms
16,772 KB |
testcase_25 | AC | 78 ms
9,996 KB |
testcase_26 | AC | 311 ms
27,528 KB |
testcase_27 | AC | 178 ms
20,668 KB |
testcase_28 | AC | 15 ms
8,064 KB |
testcase_29 | AC | 28 ms
9,084 KB |
testcase_30 | AC | 95 ms
14,824 KB |
testcase_31 | AC | 145 ms
10,788 KB |
testcase_32 | AC | 271 ms
27,152 KB |
testcase_33 | AC | 300 ms
22,976 KB |
testcase_34 | AC | 3 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 125 ms
10,172 KB |
testcase_37 | AC | 138 ms
12,684 KB |
testcase_38 | AC | 293 ms
18,792 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} const long long INF = 1001001001001001; using S = long long; S _INF(INF); S _ZERO(0LL); using F = long long; S apply(F f, S x){ return f + x; } template<typename S, typename F> struct Dijkstra{ struct Edge{ int from, to; F cost; Edge(int from, int to, F cost) : from(from), to(to), cost(cost) {}; }; int n, m; vector<bool> initialized; vector<Edge> E; vector<vector<int>> G; map<int, vector<S>> dist; map<int, vector<int>> idx; Dijkstra(int _n) : n(_n), m(0), initialized(n, false), G(n){} void add_edge(int from, int to, F cost){ Edge e(from, to, cost); E.push_back(e); G[from].emplace_back(m); m++; } void calc(int s){ initialized[s] = true; dist[s] = vector<S>(n, _INF); idx[s] = vector<int>(n, -1); priority_queue<tuple<S, int, int>, vector<tuple<S, int, int>>, greater<tuple<S, int, int>>> pq; pq.emplace(_ZERO, s, -1); while(pq.size()){ auto [dist_from, from, index] = pq.top(); pq.pop(); if(dist[s][from] <= dist_from) continue; dist[s][from] = dist_from; idx[s][from] = index; for(int index : G[from]){ int to = E[index].to; S dist_to = apply(E[index].cost, dist_from); if(dist[s][to] <= dist_to) continue; pq.emplace(dist_to, to, index); } } } int farthest(int s){ if(!initialized[s]) calc(s); int idx = 0; rep(i, n) if(dist[s][i] > dist[s][idx]) idx = i; return idx; } S get_dist(int s, int t){ if(!initialized[s]) calc(s); return dist[s][t]; } vector<int> restore(int s, int t){ if(!initialized[s]) calc(s); if(dist[s][t] == _INF) return vector<int>(0); vector<int> res; while(idx[s][t] != -1){ auto e = E[idx[s][t]]; res.push_back(idx[s][t]); t = e.from; } reverse(res.begin(), res.end()); return res; } }; int main(){ int n, m, l; long long s, e; cin >> n >> m >> l >> s >> e; Dijkstra<long long, long long> graph(n); rep(i, m){ int u, v; long long t; cin >> u >> v >> t; u--; v--; graph.add_edge(u, v, t); graph.add_edge(v, u, t); } vector<int> toilet(n); rep(i, l){ int v; cin >> v; v--; toilet[v] = 1; } long long ans = INF; rep(i, n){ if(toilet[i] == 0) continue; long long t1 = graph.get_dist(0, i); long long t2 = graph.get_dist(n - 1, i); if(t1 < s + e){ chmin(ans, max(t1, s) + 1 + t2); } } if(ans == INF) cout << "-1\n"; else cout << ans << "\n"; return 0; }