結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | leaf_1415 |
提出日時 | 2020-11-27 22:51:49 |
言語 | C++11 (gcc 11.4.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,046 bytes |
コンパイル時間 | 1,945 ms |
コンパイル使用メモリ | 91,764 KB |
実行使用メモリ | 77,540 KB |
最終ジャッジ日時 | 2023-10-09 21:45:14 |
合計ジャッジ時間 | 32,096 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
22,604 KB |
testcase_01 | AC | 8 ms
22,792 KB |
testcase_02 | AC | 745 ms
76,356 KB |
testcase_03 | AC | 655 ms
71,192 KB |
testcase_04 | AC | 956 ms
75,136 KB |
testcase_05 | AC | 676 ms
77,540 KB |
testcase_06 | AC | 823 ms
72,128 KB |
testcase_07 | AC | 758 ms
74,332 KB |
testcase_08 | AC | 642 ms
72,056 KB |
testcase_09 | AC | 735 ms
69,508 KB |
testcase_10 | AC | 616 ms
71,692 KB |
testcase_11 | AC | 822 ms
73,768 KB |
testcase_12 | AC | 815 ms
73,544 KB |
testcase_13 | AC | 757 ms
76,748 KB |
testcase_14 | AC | 716 ms
69,924 KB |
testcase_15 | AC | 741 ms
71,700 KB |
testcase_16 | AC | 896 ms
75,060 KB |
testcase_17 | AC | 831 ms
77,488 KB |
testcase_18 | AC | 713 ms
72,612 KB |
testcase_19 | AC | 781 ms
72,304 KB |
testcase_20 | AC | 857 ms
70,756 KB |
testcase_21 | AC | 767 ms
75,772 KB |
testcase_22 | AC | 875 ms
71,852 KB |
testcase_23 | AC | 817 ms
76,720 KB |
testcase_24 | AC | 869 ms
71,708 KB |
testcase_25 | AC | 906 ms
75,756 KB |
testcase_26 | AC | 768 ms
73,864 KB |
testcase_27 | AC | 837 ms
74,056 KB |
testcase_28 | AC | 694 ms
75,592 KB |
testcase_29 | AC | 1,008 ms
74,216 KB |
testcase_30 | AC | 884 ms
75,504 KB |
testcase_31 | AC | 872 ms
74,904 KB |
testcase_32 | AC | 7 ms
22,532 KB |
testcase_33 | TLE | - |
testcase_34 | -- | - |
ソースコード
#include <iostream> #include <cstdio> #include <cmath> #include <ctime> #include <cstdlib> #include <cassert> #include <vector> #include <list> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <string> #include <algorithm> #include <utility> #include <complex> #define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define all(x) (x).begin(),(x).end() #define inf 1e15 #define mod 998244353 using namespace std; typedef long long llint; typedef long long ll; typedef pair<llint, llint> P; struct edge{ llint to, cap, cost, rev; edge(){} edge(llint a, llint b, llint c, llint d){ to = a, cap = b, cost = c, rev = d; } }; llint n, m, F; llint S, T; vector<edge> G[500005]; llint dist[500005]; llint prevv[500005], preve[500005]; llint h[500005]; void BellmanFord() { for(int i = 0; i <= T; i++) dist[i] = inf; dist[S] = 0, prevv[S] = -1; bool update = true; while(update){ update = false; for(int i = 0; i <= T; i++){ for(int j = 0; j < G[i].size(); j++){ if(G[i][j].cap == 0) continue; if(dist[G[i][j].to] > dist[i] + G[i][j].cost){ dist[G[i][j].to] = dist[i] + G[i][j].cost; prevv[G[i][j].to] = i; preve[G[i][j].to] = j; update = true; } } } } } void Dijkstra() { for(int i = 0; i <= T; i++) dist[i] = inf; dist[S] = 0, prevv[S] = -1; priority_queue< P, vector<P>, greater<P> > Q; Q.push( make_pair(0, S) ); llint v, d; while(Q.size()){ d = Q.top().first; v = Q.top().second; Q.pop(); if(dist[v] < d) continue; for(int i = 0; i < G[v].size(); i++){ if(G[v][i].cap == 0) continue; llint u = G[v][i].to, c = h[v] - h[u] + G[v][i].cost; if(dist[u] > d + c){ dist[u] = d + c; prevv[u] = v; preve[u] = i; Q.push( make_pair(dist[u], u) ); } } } } void add_edge(llint from, llint to, llint cap, llint cost) { G[from].push_back( edge(to, cap, cost, G[to].size()) ); G[to].push_back( edge(from, 0, -cost, G[from].size()-1) ); } int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; ll u, v, c, d; rep(i, 1, m){ cin >> u >> v >> c >> d ; add_edge(u, n+i, 2, 0); add_edge(v, n+i, 2, 0); add_edge(n+i, n+m+i, 1, c); add_edge(n+i, n+m+i, 1, d); add_edge(n+m+i, u, 2, 0); add_edge(n+m+i, v, 2, 0); } S = 1, T = n+2*m+1; add_edge(n, T, 2, 0); BellmanFord(); for(int i = 0; i <= T; i++) h[i] = dist[i]; llint f = 2, ans = 0; while(f > 0){ Dijkstra(); if(dist[T] >= inf) break; llint p = T, flow = f; while(prevv[p] != -1){ flow = min(flow, G[prevv[p]][preve[p]].cap); p = prevv[p]; } p = T; while(prevv[p] != -1){ G[prevv[p]][preve[p]].cap -= flow; G[p][G[prevv[p]][preve[p]].rev].cap += flow; p = prevv[p]; } f -= flow; ans += (dist[T] + h[T] - h[S]) * flow; for(int i = 0; i <= T; i++) h[i] += dist[i]; //オーバーフローに注意(?) } if(f > 0) ans = -1; cout << ans << endl; return 0; }