結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | SSRS |
提出日時 | 2020-11-27 23:56:43 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 299 ms / 3,000 ms |
コード長 | 2,212 bytes |
コンパイル時間 | 2,336 ms |
コンパイル使用メモリ | 182,464 KB |
実行使用メモリ | 33,616 KB |
最終ジャッジ日時 | 2023-10-09 22:03:08 |
合計ジャッジ時間 | 11,811 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,368 KB |
testcase_01 | AC | 1 ms
4,372 KB |
testcase_02 | AC | 230 ms
33,056 KB |
testcase_03 | AC | 191 ms
29,388 KB |
testcase_04 | AC | 274 ms
32,244 KB |
testcase_05 | AC | 207 ms
32,308 KB |
testcase_06 | AC | 257 ms
29,848 KB |
testcase_07 | AC | 236 ms
30,884 KB |
testcase_08 | AC | 199 ms
29,544 KB |
testcase_09 | AC | 210 ms
28,336 KB |
testcase_10 | AC | 192 ms
29,216 KB |
testcase_11 | AC | 237 ms
30,684 KB |
testcase_12 | AC | 238 ms
30,684 KB |
testcase_13 | AC | 218 ms
32,680 KB |
testcase_14 | AC | 245 ms
28,360 KB |
testcase_15 | AC | 213 ms
29,228 KB |
testcase_16 | AC | 268 ms
31,984 KB |
testcase_17 | AC | 250 ms
33,408 KB |
testcase_18 | AC | 226 ms
30,312 KB |
testcase_19 | AC | 224 ms
30,192 KB |
testcase_20 | AC | 249 ms
29,104 KB |
testcase_21 | AC | 239 ms
31,992 KB |
testcase_22 | AC | 268 ms
29,996 KB |
testcase_23 | AC | 224 ms
32,720 KB |
testcase_24 | AC | 251 ms
29,608 KB |
testcase_25 | AC | 257 ms
31,980 KB |
testcase_26 | AC | 234 ms
30,868 KB |
testcase_27 | AC | 222 ms
30,776 KB |
testcase_28 | AC | 204 ms
32,272 KB |
testcase_29 | AC | 299 ms
31,372 KB |
testcase_30 | AC | 239 ms
31,964 KB |
testcase_31 | AC | 253 ms
31,532 KB |
testcase_32 | AC | 2 ms
4,372 KB |
testcase_33 | AC | 157 ms
25,760 KB |
testcase_34 | AC | 224 ms
33,616 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000; template <typename Cap, typename Cost> struct primal_dual{ struct edge{ int to, rev; Cap cap; Cost cost; edge(int to, int rev, Cap cap, Cost cost): to(to), rev(rev), cap(cap), cost(cost){ } }; int N; vector<vector<edge>> G; primal_dual(){ } primal_dual(int N): N(N), G(N){ } void add_edge(int from, int to, Cap cap, Cost cost){ int id1 = G[from].size(); int id2 = G[to].size(); G[from].push_back(edge(to, id2, cap, cost)); G[to].push_back(edge(from, id1, 0, - cost)); } pair<Cap, Cost> min_cost_flow(int s, int t, Cap F){ Cap flow = 0; Cost cost = 0; vector<Cost> h(N, 0); while (flow < F){ vector<Cap> m(N, INF); vector<Cost> d(N, INF); vector<int> pv(N, -1); vector<int> pe(N, -1); vector<bool> used(N, false); priority_queue<pair<Cost, int>, vector<pair<Cost, int>>, greater<pair<Cost, int>>> pq; pq.push(make_pair(0, s)); d[s] = 0; while (!pq.empty()){ int v = pq.top().second; pq.pop(); if (!used[v]){ used[v] = true; if (v == t){ break; } int cnt = G[v].size(); for (int i = 0; i < cnt; i++){ int w = G[v][i].to; if (!used[w] && G[v][i].cap > 0){ Cost tmp = G[v][i].cost - h[w] + h[v]; if (d[w] > d[v] + tmp){ d[w] = d[v] + tmp; m[w] = min(m[v], G[v][i].cap); pv[w] = v; pe[w] = i; pq.push(make_pair(d[w], w)); } } } } } if (!used[t]){ break; } for (int i = 0; i < N; i++){ if (used[i]){ h[i] -= d[t] - d[i]; } } Cap c = min(m[t], F - flow); for (int i = t; i != s; i = pv[i]){ G[pv[i]][pe[i]].cap -= c; G[i][G[pv[i]][pe[i]].rev].cap += c; } flow += c; cost += c * (- h[s]); } return make_pair(flow, cost); } }; int main(){ int N, M; cin >> N >> M; primal_dual<long long, long long> G(N); for (int i = 0; i < M; i++){ int u, v, c, d; cin >> u >> v >> c >> d; u--; v--; G.add_edge(u, v, 1, c); G.add_edge(v, u, 1, c); G.add_edge(u, v, 1, d); G.add_edge(v, u, 1, d); } cout << G.min_cost_flow(0, N - 1, 2).second << endl; }