結果
問題 | No.2805 Go to School |
ユーザー |
|
提出日時 | 2024-07-12 21:36:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 553 ms / 2,000 ms |
コード長 | 3,942 bytes |
コンパイル時間 | 5,070 ms |
コンパイル使用メモリ | 268,228 KB |
最終ジャッジ日時 | 2025-02-22 03:40:30 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#include <algorithm>#include <iostream>#include <iomanip>#include <math.h>#include <random>#include <chrono>#include <cstdint>using namespace std;using namespace atcoder;// using mint = modint998244353;using mint = modint1000000007;using vi = vector<int>;using vvi = vector<vector<int>>;using vl = vector<long long>;using vvl = vector<vector<long long>>;using ll = long long;template <class T> using max_heap = priority_queue<T>;template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)#define all(p) p.begin(),p.end()vector<pair<int, int>> dydx{{-1, 0}, {1, 0}, {0, -1 }, {0, 1}};const ll inf = 1LL << 60;void print(){ putchar(' '); }void print(bool a){ printf("%d", a); }void print(int a){ printf("%d", a); }void print(unsigned a){ printf("%u", a); }void print(long a){ printf("%ld", a); }void print(long long a){ printf("%lld", a); }void print(unsigned long long a){ printf("%llu", a); }void print(char a){ printf("%c", a); }void print(char a[]){ printf("%s", a); }void print(const char a[]){ printf("%s", a); }void print(float a){ printf("%.15f", a); }void print(double a){ printf("%.15f", a); }void print(long double a){ printf("%.15Lf", a); }void print(const string& a){ for(auto&& i : a) print(i); }template<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag());print('i'); }template<class T> void print(const vector<T>&);template<class T, size_t size> void print(const array<T, size>&);template<class T, class L> void print(const pair<T, L>& p);template<class T, size_t size> void print(const T (&)[size]);template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i);} }template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }template<class T> void print(const T& a){ cout << a; }int main() {int n, m, l;ll s, e;cin >> n >> m >> l >> s >> e;vvl dist(n, vl(2, inf));dist[0][0] = 0;vector<vector<pair<int, ll>>> G(n);vector<vector<bool>> seen(n, vector<bool>(2, false));rep(i, m){int a, b; ll t;cin >> a >> b >> t;a--, b--;G[a].push_back({b, t});G[b].push_back({a, t});}vector<int> T(n, 0);rep(i, l){int tt; cin >> tt; tt--;T[tt] = 1;}min_heap<tuple<ll, int, int>> hq;hq.push({0, 0, 0});while (!hq.empty()){int now = get<1>(hq.top());int f = get<2>(hq.top());hq.pop();if (seen[now][f]) continue;seen[now][f] = true;if (!f && T[now] && dist[now][0] <= s+e){if (dist[now][1] > dist[now][0] + 1){dist[now][1] = max(dist[now][0] + 1, s+1);hq.push({dist[now][1], now, 1});}}for (auto [nxt, nc] : G[now]){if (dist[nxt][f] > dist[now][f] + nc && !seen[nxt][f]){dist[nxt][f] = dist[now][f] + nc;hq.push({dist[nxt][f], nxt, f});}}}if (dist[n-1][1] == inf) cout << -1 << endl;else cout << dist[n-1][1] << endl;return 0;}