結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | trineutron |
提出日時 | 2020-11-27 23:14:42 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,122 bytes |
コンパイル時間 | 2,425 ms |
コンパイル使用メモリ | 215,048 KB |
実行使用メモリ | 13,452 KB |
最終ジャッジ日時 | 2023-10-09 22:03:20 |
合計ジャッジ時間 | 11,701 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,372 KB |
testcase_01 | AC | 2 ms
4,352 KB |
testcase_02 | WA | - |
testcase_03 | AC | 180 ms
9,980 KB |
testcase_04 | AC | 250 ms
12,812 KB |
testcase_05 | AC | 198 ms
11,468 KB |
testcase_06 | AC | 221 ms
11,740 KB |
testcase_07 | AC | 214 ms
11,392 KB |
testcase_08 | AC | 182 ms
10,052 KB |
testcase_09 | AC | 211 ms
11,668 KB |
testcase_10 | WA | - |
testcase_11 | AC | 230 ms
11,812 KB |
testcase_12 | AC | 239 ms
12,072 KB |
testcase_13 | AC | 214 ms
11,144 KB |
testcase_14 | AC | 204 ms
11,428 KB |
testcase_15 | AC | 208 ms
11,336 KB |
testcase_16 | AC | 252 ms
12,968 KB |
testcase_17 | AC | 226 ms
11,636 KB |
testcase_18 | AC | 203 ms
10,924 KB |
testcase_19 | AC | 229 ms
12,036 KB |
testcase_20 | AC | 231 ms
12,192 KB |
testcase_21 | AC | 228 ms
11,672 KB |
testcase_22 | AC | 239 ms
12,596 KB |
testcase_23 | AC | 223 ms
11,400 KB |
testcase_24 | AC | 236 ms
12,436 KB |
testcase_25 | AC | 252 ms
12,368 KB |
testcase_26 | AC | 224 ms
11,712 KB |
testcase_27 | AC | 231 ms
11,816 KB |
testcase_28 | AC | 201 ms
10,520 KB |
testcase_29 | WA | - |
testcase_30 | AC | 238 ms
12,200 KB |
testcase_31 | AC | 242 ms
12,532 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 216 ms
11,880 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using point = pair<int64_t, int64_t>; using edge = int64_t; using graph = vector<vector<edge>>; int main() { constexpr int64_t inf = 1e18; int64_t n, m; cin >> n >> m; vector<int64_t> u(m), v(m), c(m), d(m), distance(n, inf); graph to(n); for (int64_t i = 0; i < m; i++) { cin >> u.at(i) >> v.at(i) >> c.at(i) >> d.at(i); u.at(i)--; v.at(i)--; to.at(u.at(i)).push_back(i); to.at(v.at(i)).push_back(i); } priority_queue<point, vector<point>, greater<point>> q; q.emplace(0, 0); while (not q.empty()) { auto [cost, vertex] = q.top(); q.pop(); if (cost >= distance.at(vertex)) continue; distance.at(vertex) = cost; for (auto next : to.at(vertex)) { int64_t v_next = u.at(next) + v.at(next) - vertex; int64_t cost_next = cost + c.at(next); if (cost_next >= distance.at(v_next)) continue; q.emplace(cost_next, v_next); } } vector<bool> passed(m); int64_t current = n - 1; while (current) { for (auto prev : to.at(current)) { int64_t v_prev = u.at(prev) + v.at(prev) - current; if (distance.at(current) == distance.at(v_prev) + c.at(prev)) { current = v_prev; passed.at(prev) = true; break; } } } q.emplace(distance.at(n - 1), n - 1); for (int64_t i = 0; i < n; i++) { distance.at(i) = inf; } while (not q.empty()) { auto [cost, vertex] = q.top(); q.pop(); if (cost >= distance.at(vertex)) continue; distance.at(vertex) = cost; for (auto next : to.at(vertex)) { int64_t v_next = u.at(next) + v.at(next) - vertex; int64_t cost_next = cost + c.at(next); if (passed.at(next)) { cost_next = cost + d.at(next); } if (cost_next >= distance.at(v_next)) continue; q.emplace(cost_next, v_next); } } cout << distance.at(0) << endl; }