結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | 👑 emthrm |
提出日時 | 2020-11-27 21:57:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,371 bytes |
コンパイル時間 | 2,879 ms |
コンパイル使用メモリ | 228,196 KB |
実行使用メモリ | 32,912 KB |
最終ジャッジ日時 | 2024-09-13 00:55:15 |
合計ジャッジ時間 | 10,716 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | WA | - |
testcase_03 | AC | 146 ms
22,264 KB |
testcase_04 | AC | 231 ms
31,804 KB |
testcase_05 | AC | 147 ms
23,408 KB |
testcase_06 | AC | 200 ms
28,780 KB |
testcase_07 | AC | 187 ms
26,336 KB |
testcase_08 | AC | 145 ms
22,480 KB |
testcase_09 | AC | 196 ms
28,112 KB |
testcase_10 | WA | - |
testcase_11 | AC | 206 ms
28,660 KB |
testcase_12 | AC | 215 ms
29,744 KB |
testcase_13 | AC | 180 ms
25,740 KB |
testcase_14 | AC | 179 ms
26,740 KB |
testcase_15 | AC | 178 ms
26,052 KB |
testcase_16 | AC | 228 ms
32,288 KB |
testcase_17 | AC | 198 ms
27,040 KB |
testcase_18 | AC | 170 ms
24,796 KB |
testcase_19 | AC | 210 ms
29,232 KB |
testcase_20 | AC | 210 ms
30,048 KB |
testcase_21 | AC | 191 ms
26,928 KB |
testcase_22 | AC | 228 ms
31,168 KB |
testcase_23 | AC | 190 ms
26,288 KB |
testcase_24 | AC | 209 ms
30,036 KB |
testcase_25 | AC | 226 ms
30,652 KB |
testcase_26 | AC | 200 ms
27,212 KB |
testcase_27 | AC | 201 ms
28,328 KB |
testcase_28 | AC | 151 ms
23,660 KB |
testcase_29 | WA | - |
testcase_30 | AC | 218 ms
29,864 KB |
testcase_31 | AC | 228 ms
30,836 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 227 ms
31,352 KB |
ソースコード
#define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template <typename CostType> struct Edge { int src, dst; CostType cost; Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {} inline bool operator<(const Edge &x) const { return cost != x.cost ? cost < x.cost : dst != x.dst ? dst < x.dst : src < x.src; } inline bool operator<=(const Edge &x) const { return !(x < *this); } inline bool operator>(const Edge &x) const { return x < *this; } inline bool operator>=(const Edge &x) const { return !(*this < x); } }; template <typename CostType> struct Dijkstra { Dijkstra(const std::vector<std::vector<Edge<CostType>>> &graph, const CostType CINF) : graph(graph), CINF(CINF) {} std::vector<CostType> build(int s) { is_built = true; int n = graph.size(); std::vector<CostType> dist(n, CINF); dist[s] = 0; prev.assign(n, -1); using Pci = std::pair<CostType, int>; std::priority_queue<Pci, std::vector<Pci>, std::greater<Pci>> que; que.emplace(0, s); while (!que.empty()) { CostType cost; int ver; std::tie(cost, ver) = que.top(); que.pop(); if (dist[ver] < cost) continue; for (const Edge<CostType> &e : graph[ver]) { if (dist[e.dst] > dist[ver] + e.cost) { dist[e.dst] = dist[ver] + e.cost; prev[e.dst] = ver; que.emplace(dist[e.dst], e.dst); } } } return dist; } std::vector<int> build_path(int t) const { assert(is_built); std::vector<int> res; for (; t != -1; t = prev[t]) res.emplace_back(t); std::reverse(res.begin(), res.end()); return res; } private: bool is_built = false; std::vector<std::vector<Edge<CostType>>> graph; const CostType CINF; std::vector<int> prev; }; int main() { int n, m; cin >> n >> m; vector<vector<Edge<ll>>> graph(n); map<pair<int, int>, int> mp; vector<int> d(m); REP(i, m) { int u, v, c; cin >> u >> v >> c >> d[i]; --u; --v; graph[u].emplace_back(u, v, c); graph[v].emplace_back(v, u, c); mp[{u, v}] = i; } Dijkstra dij(graph, LINF); ll ans = dij.build(0)[n - 1]; vector<int> path = dij.build_path(n - 1); for (int i = 0; i + 1 < path.size(); ++i) { int u = path[i], v = path[i + 1]; if (u > v) swap(u, v); for (auto &e : graph[u]) { if (e.dst == v) e.cost = d[mp[{u, v}]]; } for (auto &e : graph[v]) { if (e.dst == u) e.cost = d[mp[{u, v}]]; } } cout << ans + Dijkstra(graph, LINF).build(0)[n - 1] << '\n'; return 0; }