結果

問題 No.2805 Go to School
ユーザー pitP
提出日時 2024-07-12 21:40:21
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 267 ms / 2,000 ms
コード長 2,923 bytes
コンパイル時間 7,172 ms
コンパイル使用メモリ 336,844 KB
実行使用メモリ 23,844 KB
最終ジャッジ日時 2024-07-16 01:38:37
合計ジャッジ時間 12,115 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
using Edge = pair<ll, int>;
using Graph = vector<vector<Edge>>;
vector<ll> dijkstra(int st, Graph &g){
    int N = g.size();
    vector<ll> dist(N, LINF);
    dist[st] = 0ll;
    using P = pair<ll, int>;
    priority_queue<P, vector<P>, greater<P>> pq;
    pq.emplace(P{0ll, st});
    while(!pq.empty()){
        ll time = pq.top().first;
        int now = pq.top().second;
        pq.pop();
        if (time > dist[now])continue;
        for(auto e : g[now]){
            ll c = e.first;
            int nxt = e.second;
            if (c + time < dist[nxt]){
                dist[nxt] = c + time;
                pq.push(P{c + time, nxt});
            }
        }
    }
    return dist;
}
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, M, L; cin >> N >> M >> L;
    ll S, E; cin >> S >> E;
    Graph g(N);
    rep(_, M){
        int a, b; cin >> a >> b;
        ll t; cin >> t;
        g[a - 1].push_back(Edge{t, b - 1});
        g[b - 1].push_back(Edge{t, a - 1});
    }
    vector<bool> bath(N);
    rep(_, L) {
        int T; cin >> T;
        bath[T - 1] = true;
    }
    auto dist1 = dijkstra(0, g);
    auto dist2 = dijkstra(N - 1, g);
    ll ans = LINF;
    rep(i, N)if(bath[i]){
        if(dist1[i] > S + E) continue;
        chmin(ans, max(dist1[i], S) + 1 + dist2[i]);
    }
    cout << (ans < LINF ? ans : -1) << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0