結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | milanis48663220 |
提出日時 | 2020-11-27 23:44:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,289 bytes |
コンパイル時間 | 1,108 ms |
コンパイル使用メモリ | 110,304 KB |
実行使用メモリ | 46,024 KB |
最終ジャッジ日時 | 2023-10-09 21:26:36 |
合計ジャッジ時間 | 12,404 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,476 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 159 ms
41,068 KB |
testcase_03 | AC | 137 ms
36,636 KB |
testcase_04 | AC | 203 ms
38,104 KB |
testcase_05 | AC | 133 ms
40,892 KB |
testcase_06 | AC | 174 ms
35,868 KB |
testcase_07 | AC | 164 ms
38,060 KB |
testcase_08 | AC | 126 ms
37,092 KB |
testcase_09 | AC | 170 ms
33,672 KB |
testcase_10 | AC | 128 ms
36,548 KB |
testcase_11 | AC | 172 ms
36,800 KB |
testcase_12 | AC | 174 ms
36,716 KB |
testcase_13 | AC | 162 ms
41,212 KB |
testcase_14 | AC | 157 ms
34,024 KB |
testcase_15 | AC | 161 ms
35,424 KB |
testcase_16 | AC | 199 ms
37,976 KB |
testcase_17 | AC | 169 ms
40,844 KB |
testcase_18 | AC | 150 ms
37,464 KB |
testcase_19 | AC | 179 ms
35,776 KB |
testcase_20 | AC | 181 ms
34,240 KB |
testcase_21 | AC | 166 ms
39,468 KB |
testcase_22 | AC | 183 ms
35,256 KB |
testcase_23 | AC | 161 ms
40,928 KB |
testcase_24 | AC | 176 ms
35,188 KB |
testcase_25 | AC | 188 ms
38,232 KB |
testcase_26 | AC | 164 ms
37,336 KB |
testcase_27 | AC | 169 ms
37,052 KB |
testcase_28 | AC | 135 ms
40,576 KB |
testcase_29 | AC | 203 ms
37,052 KB |
testcase_30 | AC | 197 ms
38,456 KB |
testcase_31 | AC | 186 ms
37,628 KB |
testcase_32 | AC | 1 ms
4,352 KB |
testcase_33 | AC | 85 ms
31,272 KB |
testcase_34 | TLE | - |
コンパイルメッセージ
main.cpp: メンバ関数 ‘void MinCostFlow::add_edge(int, int, ll, ll)’ 内: main.cpp:44:63: 警告: narrowing conversion of ‘(&((MinCostFlow*)this)->MinCostFlow::G.std::vector<std::vector<edge> >::operator[](((std::vector<std::vector<edge> >::size_type)to)))->std::vector<edge>::size()’ from ‘std::vector<edge>::size_type’ {aka ‘long unsigned int’} to ‘int’ [-Wnarrowing] 44 | G[from].push_back((edge){to, cap, cost, G[to].size()}); | ~~~~~~~~~~^~ main.cpp:45:66: 警告: narrowing conversion of ‘((&((MinCostFlow*)this)->MinCostFlow::G.std::vector<std::vector<edge> >::operator[](((std::vector<std::vector<edge> >::size_type)from)))->std::vector<edge>::size() - 1)’ from ‘std::vector<edge>::size_type’ {aka ‘long unsigned int’} to ‘int’ [-Wnarrowing] 45 | G[to].push_back((edge){from, 0, -cost, G[from].size()-1}); | ~~~~~~~~~~~~~~^~
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <set> #include <map> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; typedef pair<ll, int> P; const ll INF = 1e18; struct edge{ int to; ll cap, cost; int rev; }; /** * 負のコストの辺がない場合のみ使える */ class MinCostFlow{ public: int V; // 頂点数 vector<vector<edge>> G; MinCostFlow(int v){ V = v; G = vector<vector<edge>>(v, vector<edge>()); dist = vector<ll>(v); preve = vector<int>(v); prevv = vector<int>(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, int f){ ll res = 0; while(f > 0){ fill(dist.begin(), dist.end(), INF); dist[s] = 0; priority_queue<P, vector<P>, greater<P>> que; que.push(P(0, s)); while(!que.empty()){ P top = que.top(); que.pop(); int v = top.second; ll d = top.first; if(dist[v] != d) continue; for(int i = 0; i < G[v].size(); i++){ edge &e = G[v][i]; if(e.cap > 0 && dist[e.to] > dist[v]+e.cost){ dist[e.to] = dist[v]+e.cost; prevv[e.to] = v; preve[e.to] = i; que.push(P(dist[e.to], e.to)); } } } if(dist[t] == INF){ return -1; } ll d = f; for(int v = t; v != s; v = prevv[v]){ d = min(d, G[prevv[v]][preve[v]].cap); } f -= d; res += d*dist[t]; for(int v = t; v != s; v = prevv[v]){ edge &e = G[prevv[v]][preve[v]]; e.cap -= d; G[v][e.rev].cap += d; } } return res; } private: vector<ll> dist; vector<int> prevv, preve; }; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n, m; cin >> n >> m; MinCostFlow mcf(n); for(int i = 0; i < m; i++){ int u, v, c, d; cin >> u >> v >> c >> d; u--; v--; 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); } cout << mcf.min_cost_flow(0, n-1, 2) << endl; }