結果
問題 | No.2805 Go to School |
ユーザー | hirayuu_yc |
提出日時 | 2024-07-04 08:00:23 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,227 bytes |
コンパイル時間 | 6,625 ms |
コンパイル使用メモリ | 286,936 KB |
実行使用メモリ | 22,244 KB |
最終ジャッジ日時 | 2024-07-04 21:14:21 |
合計ジャッジ時間 | 11,762 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
10,624 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 98 ms
14,272 KB |
testcase_05 | AC | 53 ms
9,128 KB |
testcase_06 | AC | 46 ms
9,228 KB |
testcase_07 | AC | 79 ms
14,428 KB |
testcase_08 | AC | 72 ms
9,316 KB |
testcase_09 | AC | 53 ms
9,052 KB |
testcase_10 | AC | 222 ms
20,952 KB |
testcase_11 | AC | 123 ms
14,560 KB |
testcase_12 | AC | 176 ms
18,344 KB |
testcase_13 | AC | 23 ms
6,016 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 82 ms
11,312 KB |
testcase_18 | AC | 51 ms
8,872 KB |
testcase_19 | AC | 128 ms
15,616 KB |
testcase_20 | AC | 181 ms
20,008 KB |
testcase_21 | AC | 67 ms
10,712 KB |
testcase_22 | AC | 116 ms
14,344 KB |
testcase_23 | AC | 116 ms
14,340 KB |
testcase_24 | AC | 32 ms
8,764 KB |
testcase_25 | AC | 135 ms
22,244 KB |
testcase_26 | AC | 70 ms
16,384 KB |
testcase_27 | AC | 7 ms
6,784 KB |
testcase_28 | AC | 13 ms
7,808 KB |
testcase_29 | AC | 39 ms
12,160 KB |
testcase_30 | AC | 58 ms
9,984 KB |
testcase_31 | TLE | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
ソースコード
//https://yukicoder.me/submissions/992187 #line 2 "library/template/template.hpp" #include <bits/stdc++.h> #line 3 "library/template/macro.hpp" #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define elif else if #define updiv(N, X) (((N) + (X) - (1)) / (X)) #define sigma(a, b) ((a + b) * (b - a + 1) / 2) #define INT(...) \ int __VA_ARGS__; \ scan(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ scan(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ scan(__VA_ARGS__) #define CHR(...) \ char __VA_ARGS__; \ scan(__VA_ARGS__) #define DOU(...) \ double __VA_ARGS__; \ scan(__VA_ARGS__) #define LD(...) \ ld __VA_ARGS__; \ scan(__VA_ARGS__) #define pb push_back #define eb emplace_back #line 3 "library/template/alias.hpp" using ll = long long; using ld = long double; using pii = std::pair<int, int>; using pll = std::pair<ll, ll>; constexpr int inf = 1 << 30; constexpr ll INF = 1LL << 60; constexpr int dx[8] = {1, 0, -1, 0, 1, -1, 1, -1}; constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; constexpr int mod = 998244353; constexpr int MOD = 1e9 + 7; #line 3 "library/template/func.hpp" template <typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template <typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } template <typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) { os << p.first << " " << p.second; return os; } template <typename T, typename U> std::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) { for (auto it = std::begin(v); it != std::end(v);) { os << *it << ((++it) != std::end(v) ? " " : ""); } return os; } template <typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &in : v) { is >> in; } return is; } inline void scan() {} template <class Head, class... Tail> inline void scan(Head &head, Tail &...tail) { std::cin >> head; scan(tail...); } template <class T> inline void print(const T &t) { std::cout << t << '\n'; } template <class Head, class... Tail> inline void print(const Head &head, const Tail &...tail) { std::cout << head << ' '; print(tail...); } template <class... T> inline void fin(const T &...a) { print(a...); exit(0); } #line 3 "library/template/util.hpp" struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout.tie(0); std::cout << std::fixed << std::setprecision(12); std::cerr << std::fixed << std::setprecision(12); } } IOSetup; #line 3 "library/template/debug.hpp" #ifdef LOCAL #include <debug.hpp> #else #define debug(...) #endif #line 8 "library/template/template.hpp" using namespace std; #line 2 "B.cpp" vector<ll> dijkstra(const vector<vector<pair<int, ll>>> &G, const int &s) { int N = G.size(); vector<ll> dis(N, INF); priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq; dis[s] = 0; pq.emplace(dis[s], s); while (!pq.empty()) { pair<ll, int> p = pq.top(); pq.pop(); int v = p.second; for (auto &[to, cost] : G[v]) { if (dis[to] > dis[v] + cost) { dis[to] = dis[v] + cost; pq.emplace(dis[to], to); } } } return dis; } int main() { INT(N, M, L); LL(S, E); vector<vector<pair<int, ll>>> G(N); for (int i = 0; i < M; i++) { INT(a, b); a--, b--; LL(t); G[a].push_back({b, t}); G[b].push_back({a, t}); } vector<int> T(L); scan(T); auto dis1 = dijkstra(G, 0); auto dis2 = dijkstra(G, N - 1); if (dis1[N - 1] <= S) { fin(S+1); } ll ans = INF; for (int i = 0; i < L; i++) { int t = T[i] - 1; if (dis1[t] < S + E) { chmin(ans, max(dis1[t], S) + 1 + dis2[t]); } } print(ans == INF ? -1 : ans); }