結果

問題 No.2805 Go to School
ユーザー Slephy
提出日時 2024-07-12 21:21:11
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 206 ms / 2,000 ms
コード長 3,526 bytes
コンパイル時間 2,101 ms
コンパイル使用メモリ 205,416 KB
最終ジャッジ日時 2025-02-22 03:30:26
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = (int)1e9 + 1001010;
const ll llINF = (long long)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
const string ELM_SEP = " ", VEC_SEP = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELM_SEP : "");} return 
    o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEP : ""
    );} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}
ll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
#ifdef DEBUG
#include <cpp-dump/dump.hpp>
#define dump(...) cpp_dump(__VA_ARGS__)
namespace cp = cpp_dump;
struct InitCppDump{
    InitCppDump(){
        if(!isatty(fileno(stderr))) CPP_DUMP_SET_OPTION(es_style, cpp_dump::es_style_t::no_es);
        CPP_DUMP_SET_OPTION(log_label_func, cp::log_label::line());
        CPP_DUMP_SET_OPTION(max_iteration_count, 30);
    }
} init_cpp_dump;
#else
#define dump(...)
#endif
// ================================== ここまでテンプレ ==================================
template<class T> using max_heap = priority_queue<T>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n, m, l, s, e; cin >> n >> m >> l >> s >> e;
    auto graph = vector2<pair<ll, ll>>(n, 0);
    for(int i = 0; i < m; i++){
        ll a, b, t; cin >> a >> b >> t;
        a--; b--;
        graph[a].emplace_back(b, t);
        graph[b].emplace_back(a, t);
    }
    dump(graph);
    auto calc_dist = [&](const vector<vector<pair<ll, ll>>> &graph, int from) -> vector<ll> {
        vector<ll> dist(n, llINF);
        dist[from] = 0;
        min_heap<pair<ll, ll>> pq;
        pq.emplace(0, from);
        while(!pq.empty()){
            auto [d, now] = pq.top(); pq.pop();
            if(dist[now] < d) continue;
            for(const auto &[nxt, ecost] : graph[now]){
                if(chmin(dist[nxt], d + ecost)){
                    pq.emplace(dist[nxt], nxt);
                }
            }
        }
        return dist;
    };
    auto dist_0 = calc_dist(graph, 0);
    auto dist_n = calc_dist(graph, n-1);
    dump(dist_0);
    dump(dist_n);
    ll ans = llINF;
    for(int tid = 0; tid < l; tid++){
        int t; cin >> t;
        t--;
        ll d1 = dist_0[t];
        ll d2 = dist_n[t];
        if(d1 > s+e-1) continue;
        ll this_ans = max(s+1, d1+1) + d2;
        chmin(ans, this_ans);
    }
    if(ans == llINF){
        cout << -1 << endn;
    }else{
        cout << ans << endn;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0