結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | kaikey |
提出日時 | 2020-11-28 00:40:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 190 ms / 3,000 ms |
コード長 | 5,535 bytes |
コンパイル時間 | 2,274 ms |
コンパイル使用メモリ | 216,316 KB |
実行使用メモリ | 44,544 KB |
最終ジャッジ日時 | 2024-07-26 21:28:17 |
合計ジャッジ時間 | 9,106 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 154 ms
41,876 KB |
testcase_03 | AC | 122 ms
37,304 KB |
testcase_04 | AC | 190 ms
39,552 KB |
testcase_05 | AC | 128 ms
41,340 KB |
testcase_06 | AC | 168 ms
36,816 KB |
testcase_07 | AC | 154 ms
39,088 KB |
testcase_08 | AC | 126 ms
37,692 KB |
testcase_09 | AC | 153 ms
34,816 KB |
testcase_10 | AC | 123 ms
37,304 KB |
testcase_11 | AC | 166 ms
38,048 KB |
testcase_12 | AC | 171 ms
37,952 KB |
testcase_13 | AC | 150 ms
42,096 KB |
testcase_14 | AC | 153 ms
35,120 KB |
testcase_15 | AC | 148 ms
36,508 KB |
testcase_16 | AC | 181 ms
39,296 KB |
testcase_17 | AC | 159 ms
42,272 KB |
testcase_18 | AC | 142 ms
38,300 KB |
testcase_19 | AC | 165 ms
36,992 KB |
testcase_20 | AC | 169 ms
35,584 KB |
testcase_21 | AC | 156 ms
40,256 KB |
testcase_22 | AC | 164 ms
36,736 KB |
testcase_23 | AC | 153 ms
41,624 KB |
testcase_24 | AC | 170 ms
36,480 KB |
testcase_25 | AC | 180 ms
39,424 KB |
testcase_26 | AC | 156 ms
38,168 KB |
testcase_27 | AC | 167 ms
38,252 KB |
testcase_28 | AC | 126 ms
41,236 KB |
testcase_29 | AC | 182 ms
38,528 KB |
testcase_30 | AC | 186 ms
39,472 KB |
testcase_31 | AC | 186 ms
38,912 KB |
testcase_32 | AC | 2 ms
6,944 KB |
testcase_33 | AC | 86 ms
32,128 KB |
testcase_34 | AC | 177 ms
44,544 KB |
ソースコード
#include <bits/stdc++.h> #include <random> using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) #define endk '\n' template<class T> auto add = [](T a, T b) -> T { return a + b; }; template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); }; template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); }; template<class T> using V = vector<T>; using Vl = V<lint>; using VVl = V<Vl>; template< typename T > ostream& operator<<(ostream & os, const vector< T > & v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : ""); return os; } template< typename T >istream& operator>>(istream & is, vector< T > & v) { for (T& in : v) is >> in; return is; } template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); } lint ceil(lint a, lint b) { return (a + b - 1) / b; } lint digit(lint a) { return (lint)log10(a); } lint dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); } void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); } const lint MOD = 998244353, INF = 5e18; lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 }; void YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; } void yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; } typedef pair<lint, string> Pa; typedef pair<lint, plint> tlint; struct Edge { lint from, to; lint cost; Edge(lint u, lint v, lint c) { cost = c; from = u; to = v; } bool operator<(const Edge& e) const { return cost < e.cost; } }; struct WeightedEdge { lint to; lint cost; WeightedEdge(lint v, lint c = 1) { to = v; cost = c; } bool operator<(const WeightedEdge& e) const { return cost < e.cost; } }; using WeightedGraph = V<V<WeightedEdge>>; template<typename flow_t, typename cost_t> struct Flow { const cost_t INF; struct edge { lint to; flow_t cap; cost_t cost; lint rev; }; vector<vector<edge> > Graph; vector<cost_t> potential, min_cost; vector<lint> prevv, preve; vector<lint> level; vector<lint> iter; Flow(lint V) :Graph(V), INF(numeric_limits< cost_t >::max()) {} void add_edge(lint from, lint to, flow_t cap, cost_t cost = 0) { Graph[from].push_back({ to, cap, cost, SZ(Graph[to]) }); Graph[to].push_back({ from, 0, -cost, SZ(Graph[from]) - 1 }); } void bfs(lint s) { lint V = SZ(Graph); level.assign(V, -1); queue<lint> que; que.push(s); level[s] = 0; while (!que.empty()) { lint v = que.front(); que.pop(); REP(i, SZ(Graph[v])) { edge& e = Graph[v][i]; if (e.cap > 0 && level[e.to] < 0) { level[e.to] = level[v] + 1; que.push(e.to); } } } } flow_t dfs(lint v, lint t, flow_t f) { if (v == t) return f; for (lint& i = iter[v]; i < SZ(Graph[v]); i++) { edge& e = Graph[v][i]; if (e.cap > 0 && level[v] < level[e.to]) { flow_t d = dfs(e.to, t, min(f, e.cap)); if (d > 0) { e.cap -= d; Graph[e.to][e.rev].cap += d; return d; } } } return 0; } flow_t max_flow(lint s, lint t) { flow_t flow = 0; lint V = SZ(Graph); for (;;) { bfs(s); if (level[t] < 0) return flow; iter.assign(V, 0); flow_t f; while ((f = dfs(s, t, INF)) > 0) { flow += f; } } } lint min_cost_flow(lint s, lint t, lint f) { cost_t res = 0; lint V = SZ(Graph); potential.assign(V, 0); prevv.assign(V, -1); preve.assign(V, -1); while (f > 0) { priority_queue<pair<cost_t, lint>, vector<pair<cost_t, lint> >, greater<pair<cost_t, lint> > > que; min_cost.assign(V, INF); min_cost[s] = 0; que.push({ 0, s }); while (!que.empty()) { pair<cost_t, lint> p = que.top(); que.pop(); lint v = p.second; if (min_cost[v] < p.first) continue; REP(i, SZ(Graph[v])) { edge& e = Graph[v][i]; cost_t nextCost = min_cost[v] + e.cost + potential[v] - potential[e.to]; if (e.cap > 0 && min_cost[e.to] > nextCost) { min_cost[e.to] = nextCost; prevv[e.to] = v; preve[e.to] = i; que.push({ min_cost[e.to], e.to }); } } } if (min_cost[t] == INF) { return -1; } REP(v, V) potential[v] += min_cost[v]; flow_t addflow = f; for (lint v = t; v != s; v = prevv[v]) { addflow = min(addflow, Graph[prevv[v]][preve[v]].cap); } f -= addflow; res += addflow * potential[t]; for (lint v = t; v != s; v = prevv[v]) { edge& e = Graph[prevv[v]][preve[v]]; e.cap -= addflow; Graph[v][e.rev].cap += addflow; } } return res; } }; lint N, M, u, v, s, t; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cin >> N >> M; Flow<lint, lint> g(N); REP(i, M) { cin >> u >> v >> s >> t; u--; v--; g.add_edge(u, v, 1, s); g.add_edge(v, u, 1, s); g.add_edge(u, v, 1, t); g.add_edge(v, u, 1, t); } cout << g.min_cost_flow(0, N - 1, 2) << endk; }