結果
問題 | No.1 道のショートカット |
ユーザー |
![]() |
提出日時 | 2018-03-29 12:58:18 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,646 bytes |
コンパイル時間 | 1,133 ms |
コンパイル使用メモリ | 116,160 KB |
実行使用メモリ | 11,264 KB |
最終ジャッジ日時 | 2024-07-08 05:00:16 |
合計ジャッジ時間 | 2,986 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 36 WA * 4 |
ソースコード
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <tuple> # include <unordered_map> # include <numeric> # include <complex> # include <bitset> # include <random> # include <chrono> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr int INF = 2147483647; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr double HDINF = 50000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; const double PI = acos(-1); int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }; template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }; # define ALL(x) (x).begin(),(x).end() # define UNIQ(c) (c).erase(unique(ALL((c))),(c).end()) # define LOWER(s) transform(ALL((s)),(s).begin(),TL<char>) # define UPPER(s) transform(ALL((s)),(s).begin(),TU<char>) # define mp make_pair # define eb emplace_back # define FOR(i,a,b) for(LL i=(a);i<(b);i++) # define RFOR(i,a,b) for(LL i=(a);i>=(b);i--) # define REP(i,n) FOR(i,0,n) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) int n, c, v; int s[101010], t[101010], y[101010], m[101010]; struct edge { LL to, cost, pay; }; typedef pair<LL, pair<int, int>> P; LL d[1515][330]; //距離 vector<edge> vec[100100]; void dijkstra() { for (int i = 0; i < 1515; i++)REP(j, 330)d[i][j] = HLINF; priority_queue<P, std::vector<P>, std::greater<P>> pq; d[1][0] = 0; pq.push(make_pair(d[1][0], mp(1, 0)));//cost,to while (!pq.empty()) { P p = pq.top(); pq.pop(); int i = p.second.first; int j = p.second.second; //if (d[i][j] < p.first)continue; for (int k = 0; k < vec[i].size(); k++) { edge e = vec[i][k]; if (j + e.pay > c)continue; if (d[e.to][j + e.pay] <= d[i][j] + e.cost)continue; d[e.to][j + e.pay] = d[i][j] + e.cost; pq.push(make_pair(d[e.to][j + e.pay], mp(e.to, j + e.pay))); } } } int main() { cin >> n >> c >> v; REP(i, v) { cin >> s[i]; } REP(i, v) { cin >> t[i]; } REP(i, v) { cin >> y[i]; } REP(i, v) { cin >> m[i]; } REP(i, v) { vec[s[i]].emplace_back(edge{ t[i],m[i],y[i] }); vec[t[i]].emplace_back(edge{ s[i],m[i],y[i] }); } dijkstra(); LL ans = HLINF; for(int i = c; i >= 0; i--) { ans = min(ans, d[n][i]); } cout << (ans == HLINF ? -1 : ans) << endl; //system("pause"); }