結果
問題 | No.2805 Go to School |
ユーザー | fuppy_kyopro |
提出日時 | 2024-07-12 21:21:26 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 202 ms / 2,000 ms |
コード長 | 5,129 bytes |
コンパイル時間 | 3,382 ms |
コンパイル使用メモリ | 237,040 KB |
実行使用メモリ | 31,304 KB |
最終ジャッジ日時 | 2024-07-16 01:37:16 |
合計ジャッジ時間 | 7,642 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 90 ms
20,992 KB |
testcase_05 | AC | 108 ms
14,900 KB |
testcase_06 | AC | 54 ms
9,472 KB |
testcase_07 | AC | 48 ms
9,344 KB |
testcase_08 | AC | 80 ms
14,848 KB |
testcase_09 | AC | 59 ms
9,668 KB |
testcase_10 | AC | 41 ms
8,704 KB |
testcase_11 | AC | 139 ms
25,772 KB |
testcase_12 | AC | 76 ms
15,488 KB |
testcase_13 | AC | 118 ms
19,712 KB |
testcase_14 | AC | 19 ms
7,424 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 83 ms
12,560 KB |
testcase_19 | AC | 51 ms
9,984 KB |
testcase_20 | AC | 133 ms
16,412 KB |
testcase_21 | AC | 198 ms
28,148 KB |
testcase_22 | AC | 75 ms
13,696 KB |
testcase_23 | AC | 113 ms
16,528 KB |
testcase_24 | AC | 109 ms
16,252 KB |
testcase_25 | AC | 43 ms
11,096 KB |
testcase_26 | AC | 198 ms
31,304 KB |
testcase_27 | AC | 95 ms
24,320 KB |
testcase_28 | AC | 14 ms
10,240 KB |
testcase_29 | AC | 18 ms
11,520 KB |
testcase_30 | AC | 50 ms
18,304 KB |
testcase_31 | AC | 65 ms
12,672 KB |
testcase_32 | AC | 129 ms
27,128 KB |
testcase_33 | AC | 202 ms
25,680 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
testcase_36 | AC | 54 ms
10,880 KB |
testcase_37 | AC | 61 ms
13,440 KB |
testcase_38 | AC | 89 ms
21,524 KB |
ソースコード
//* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //*/ // #include <atcoder/all> #include <bits/stdc++.h> using namespace std; // using namespace atcoder; // #define _GLIBCXX_DEBUG #define DEBUG(x) cerr << #x << ": " << x << endl; #define DEBUG_VEC(v) \ cerr << #v << ":"; \ for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \ cerr << " " << v[iiiiiiii]; \ cerr << endl; #define DEBUG_MAT(v) \ cerr << #v << endl; \ for (int iv = 0; iv < v.size(); iv++) { \ for (int jv = 0; jv < v[iv].size(); jv++) { \ cerr << v[iv][jv] << " "; \ } \ cerr << endl; \ } typedef long long ll; // #define int ll #define vi vector<int> #define vl vector<ll> #define vii vector<vector<int>> #define vll vector<vector<ll>> #define pii pair<int, int> #define pis pair<int, string> #define psi pair<string, int> #define pll pair<ll, ll> template <class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); } template <class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); } template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define rrep1(i, n) for (int i = (int)(n); i > 0; i--) #define REP(i, a, b) for (int i = a; i < b; i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(), c.end() void YES(bool t = true) { cout << (t ? "YES" : "NO") << endl; } void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; } void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; } void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; } void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; } void no(bool t = true) { cout << (t ? "no" : "yes") << endl; } template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } template <class T> T ceil_div(T a, T b) { return (a + b - 1) / b; } template <class T> T safe_mul(T a, T b) { if (a == 0 || b == 0) return 0; if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max(); return a * b; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; int popcount(ll t) { return __builtin_popcountll(t); } vector<int> gen_perm(int n) { vector<int> ret(n); iota(all(ret), 0); return ret; } // int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; // int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 }; vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0}; vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1}; struct Setup_io { Setup_io() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cout << fixed << setprecision(25); cerr << fixed << setprecision(25); } } setup_io; // constexpr ll MOD = 1000000007; constexpr ll MOD = 998244353; // #define mp make_pair signed main() { ll n, m, l, s, e; cin >> n >> m >> l >> s >> e; e += s; vector<vector<pll>> G(n); rep(i, m) { int u, v, t; cin >> u >> v >> t; u--; v--; G[u].push_back({v, t}); G[v].push_back({u, t}); } vi is_ok(n); rep(i, l) { int a; cin >> a; a--; is_ok[a] = 1; } vll dist(n, vl(2, INF)); dist[0][0] = 0; priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<pair<ll, pll>>> pq; pq.push({0, {0, 0}}); while (pq.size()) { auto [d, p] = pq.top(); pq.pop(); auto [u, b] = p; if (dist[u][b] < d) continue; if (b == 0) { assert(d < e); } if (b == 0 && is_ok[u]) { ll nd; if (d >= s) { nd = d + 1; } else { nd = s + 1; } if (chmin(dist[u][1], nd)) { pq.push({dist[u][1], {u, 1}}); } } for (auto [v, t] : G[u]) { if (b == 0 && d + t >= e) { continue; } if (chmin(dist[v][b], d + t)) { pq.push({dist[v][b], {v, b}}); } } } // DEBUG_MAT(dist); ll ans = dist[n - 1][1]; if (ans == INF) { ans = -1; } cout << ans << endl; }