結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | siman |
提出日時 | 2022-03-24 18:26:22 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,973 bytes |
コンパイル時間 | 1,176 ms |
コンパイル使用メモリ | 145,512 KB |
実行使用メモリ | 47,444 KB |
最終ジャッジ日時 | 2024-10-13 02:06:49 |
合計ジャッジ時間 | 11,056 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
9,600 KB |
testcase_01 | AC | 4 ms
9,728 KB |
testcase_02 | AC | 231 ms
46,144 KB |
testcase_03 | AC | 206 ms
42,672 KB |
testcase_04 | WA | - |
testcase_05 | AC | 221 ms
47,108 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 206 ms
42,840 KB |
testcase_09 | WA | - |
testcase_10 | AC | 208 ms
42,460 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 233 ms
46,056 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 215 ms
46,456 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 4 ms
9,600 KB |
testcase_33 | AC | 164 ms
36,480 KB |
testcase_34 | AC | 257 ms
47,176 KB |
ソースコード
#include <cassert> #include <cmath> #include <algorithm> #include <iostream> #include <iomanip> #include <limits.h> #include <map> #include <queue> #include <set> #include <string.h> #include <vector> using namespace std; typedef long long ll; const int MAX_V = 200010; const int INF = INT_MAX; typedef pair<ll, int> P; int V; struct Point { int y; int x; Point(int y = -1, int x = -1) { this->y = y; this->x = x; } }; struct Edge { int to; ll cap; ll cost; int rev; Edge(int to = -1, ll cap = -1, ll cost = -1, int rev = -1) { this->to = to; this->cap = cap; this->cost = cost; this->rev = rev; } }; ll h[MAX_V]; int dist[MAX_V]; int prevv[MAX_V]; int preve[MAX_V]; vector <Edge> G[MAX_V]; class MinCostFlow { public: int V; MinCostFlow(int V) { this->V = V; } void add_edge(int from, int to, ll cap, ll cost) { G[from].push_back(Edge(to, cap, cost, G[to].size())); G[to].push_back(Edge(from, 0, -cost, G[from].size() - 1)); } ll min_cost_flow(int s, int t, ll flow_limit) { ll f = 0; ll totalCost = 0; fill(h, h + MAX_V, 0); while (f < flow_limit) { // fprintf(stderr, "f: %lld, limit: %lld\n", f, flow_limit); priority_queue<P, vector<P>, greater<P>> pque; fill(dist, dist + V, INF); dist[s] = 0; pque.push(P(0, s)); while (!pque.empty()) { P p = pque.top(); pque.pop(); int v = p.second; if (dist[v] < p.first) continue; for (int i = 0; i < (int) G[v].size(); ++i) { Edge *edge = &G[v][i]; if (edge->cap <= 0) continue; ll cost = edge->cost + h[v] - h[edge->to]; if (dist[edge->to] - dist[v] > cost) { dist[edge->to] = dist[v] + cost; prevv[edge->to] = v; preve[edge->to] = i; pque.push(P(dist[edge->to], edge->to)); } } } if (dist[t] == INF) { return -1; } for (int v = 0; v < V; ++v) { h[v] += dist[v]; } ll c = flow_limit - f; for (int v = t; v != s; v = prevv[v]) { c = min(c, G[prevv[v]][preve[v]].cap); } f += c; totalCost += c * h[t]; // fprintf(stderr, "h[s]: %d, h[t]: %d, cost: %d, prev_cost: %d\n", h[s], h[t], cost, prev_cost); for (int v = t; v != s; v = prevv[v]) { Edge *edge = &G[prevv[v]][preve[v]]; edge->cap -= c; G[v][edge->rev].cap += c; } } return totalCost; } }; int main() { int N, M; cin >> N >> M; V = N + 3; MinCostFlow mcf(V); int u, v; ll c, d; for (int i = 0; i < M; ++i) { cin >> u >> v >> c >> d; mcf.add_edge(u, v, 1, c); mcf.add_edge(v, u, 1, c); mcf.add_edge(u, v, 1, d); mcf.add_edge(v, u, 1, d); } int s = N + 1; int t = N + 2; mcf.add_edge(s, 1, 2, 0); mcf.add_edge(N, t, 2, 0); ll res = mcf.min_cost_flow(s, t, 2); cout << res << endl; return 0; }