結果
問題 | No.1678 Coin Trade (Multiple) |
ユーザー | SSRS |
提出日時 | 2021-09-10 21:46:28 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 718 ms / 5,000 ms |
コード長 | 2,556 bytes |
コンパイル時間 | 2,114 ms |
コンパイル使用メモリ | 187,384 KB |
実行使用メモリ | 15,840 KB |
最終ジャッジ日時 | 2024-06-11 23:17:24 |
合計ジャッジ時間 | 14,247 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 56 |
ソースコード
#include <bits/stdc++.h>using namespace std;const long long INF = 1000000000000;const long long INF2 = 1000000000000000000;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, INF2);vector<Cost> d(N, INF2);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, K;cin >> N >> K;vector<int> A(N), M(N);vector<vector<int>> B(N);for (int i = 0; i < N; i++){cin >> A[i] >> M[i];B[i] = vector<int>(M[i]);for (int j = 0; j < M[i]; j++){cin >> B[i][j];B[i][j]--;}}primal_dual<long long, long long> G(N);for (int i = 0; i < N - 1; i++){G.add_edge(i, i + 1, K, INF);}for (int i = 0; i < N; i++){for (int j = 0; j < M[i]; j++){if (A[i] - A[B[i][j]] > 0){G.add_edge(B[i][j], i, 1, INF * (i - B[i][j]) - (A[i] - A[B[i][j]]));}}}cout << (N - 1) * K * INF - G.min_cost_flow(0, N - 1, K).second << endl;}