結果
問題 | No.1615 Double Down |
ユーザー | msm1993 |
提出日時 | 2021-08-02 09:57:51 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 673 ms / 10,000 ms |
コード長 | 4,655 bytes |
コンパイル時間 | 895 ms |
コンパイル使用メモリ | 104,420 KB |
実行使用メモリ | 8,832 KB |
最終ジャッジ日時 | 2024-04-29 22:31:20 |
合計ジャッジ時間 | 18,337 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 378 ms
7,168 KB |
testcase_01 | AC | 365 ms
7,168 KB |
testcase_02 | AC | 416 ms
8,064 KB |
testcase_03 | AC | 427 ms
8,064 KB |
testcase_04 | AC | 403 ms
7,936 KB |
testcase_05 | AC | 408 ms
8,064 KB |
testcase_06 | AC | 522 ms
8,704 KB |
testcase_07 | AC | 447 ms
8,704 KB |
testcase_08 | AC | 500 ms
8,832 KB |
testcase_09 | AC | 673 ms
8,064 KB |
testcase_10 | AC | 631 ms
7,936 KB |
testcase_11 | AC | 667 ms
7,936 KB |
testcase_12 | AC | 376 ms
8,320 KB |
testcase_13 | AC | 413 ms
8,192 KB |
testcase_14 | AC | 435 ms
8,192 KB |
testcase_15 | AC | 210 ms
8,704 KB |
testcase_16 | AC | 295 ms
8,704 KB |
testcase_17 | AC | 281 ms
8,704 KB |
testcase_18 | AC | 609 ms
8,064 KB |
testcase_19 | AC | 576 ms
7,936 KB |
testcase_20 | AC | 614 ms
7,936 KB |
testcase_21 | AC | 627 ms
7,936 KB |
testcase_22 | AC | 603 ms
7,936 KB |
testcase_23 | AC | 604 ms
7,808 KB |
testcase_24 | AC | 656 ms
7,936 KB |
testcase_25 | AC | 574 ms
7,936 KB |
testcase_26 | AC | 586 ms
8,064 KB |
testcase_27 | AC | 63 ms
5,376 KB |
testcase_28 | AC | 66 ms
5,376 KB |
testcase_29 | AC | 111 ms
5,760 KB |
testcase_30 | AC | 131 ms
5,888 KB |
testcase_31 | AC | 122 ms
5,632 KB |
testcase_32 | AC | 126 ms
5,888 KB |
testcase_33 | AC | 208 ms
6,144 KB |
testcase_34 | AC | 167 ms
6,144 KB |
testcase_35 | AC | 263 ms
6,272 KB |
testcase_36 | AC | 8 ms
5,376 KB |
testcase_37 | AC | 4 ms
5,376 KB |
testcase_38 | AC | 9 ms
5,376 KB |
testcase_39 | AC | 6 ms
5,376 KB |
testcase_40 | AC | 6 ms
5,376 KB |
testcase_41 | AC | 6 ms
5,376 KB |
testcase_42 | AC | 13 ms
5,376 KB |
testcase_43 | AC | 14 ms
5,376 KB |
testcase_44 | AC | 11 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
testcase_48 | AC | 2 ms
5,376 KB |
testcase_49 | AC | 2 ms
5,376 KB |
testcase_50 | AC | 2 ms
5,376 KB |
testcase_51 | AC | 2 ms
5,376 KB |
testcase_52 | AC | 2 ms
5,376 KB |
testcase_53 | AC | 2 ms
5,376 KB |
testcase_54 | AC | 2 ms
5,376 KB |
testcase_55 | AC | 2 ms
5,376 KB |
testcase_56 | AC | 3 ms
5,376 KB |
ソースコード
#include <cassert> #include <cmath> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <functional> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using Int = long long; template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; }; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; } template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; } template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; } namespace MCF { using Capa = int; using Cost = Int; constexpr int MAX_N = 100'010; constexpr int MAX_M = 100'010; constexpr int QUE_SIZE = 1 << (32 - __builtin_clz(MAX_N)); constexpr int BELLMAN_FORD_NUM_ITERS = 10; constexpr int LOG_SCALING = 2; int n, m, ptr[MAX_N], cur[MAX_N], next[MAX_M << 1], zu[MAX_M << 1]; bool on[MAX_N]; int que[QUE_SIZE], qb, qe; Capa capa[MAX_M << 1], ex[MAX_N]; Cost cost[MAX_M << 1], pot[MAX_N], pot0[MAX_N]; void init(int n_) { n = n_; m = 0; memset(ptr, ~0, n * sizeof(int)); memset(ex, 0, n * sizeof(Capa)); } void ae(int u, int v, Capa c, Cost d) { d *= (n + 1); next[m] = ptr[u]; ptr[u] = m; zu[m] = v; capa[m] = c; cost[m] = d; ++m; next[m] = ptr[v]; ptr[v] = m; zu[m] = u; capa[m] = 0; cost[m] = -d; ++m; } bool bellmanFord(Cost eps) { memcpy(pot0, pot, n * sizeof(Cost)); for (int iter = 0; iter < BELLMAN_FORD_NUM_ITERS; ++iter) { bool upd = false; for (int i = 0; i < m; ++i) { if (capa[i] > 0) { const int u = zu[i ^ 1], v = zu[i]; if (pot0[v] > pot0[u] + cost[i] + eps) { pot0[v] = pot0[u] + cost[i] + eps; upd = true; } } } if (!upd) { memcpy(pot, pot0, n * sizeof(Cost)); return true; } } return false; } Cost solve() { Cost minCost = 0; for (int i = 0; i < m; i += 2) if (minCost > cost[i]) minCost = cost[i]; Cost eps = 1; for (; eps < -minCost; eps <<= LOG_SCALING) {} memset(pot, 0, n * sizeof(Cost)); for (; eps >>= LOG_SCALING; ) { if (bellmanFord(eps)) continue; for (int i = 0; i < m; i += 2) { const int u = zu[i ^ 1], v = zu[i]; const Cost d = cost[i] + pot[u] - pot[v]; if (capa[i] > 0 && d < 0) { Capa &c = capa[i]; ex[u] -= c; ex[v] += c; capa[i ^ 1] += c; c = 0; } else if (capa[i ^ 1] > 0 && -d < 0) { Capa &c = capa[i ^ 1]; ex[v] -= c; ex[u] += c; capa[i] += c; c = 0; } } memcpy(cur, ptr, n * sizeof(int)); qb = qe = 0; for (int u = 0; u < n; ++u) if (ex[u] > 0) { que[qe] = u; ++qe &= QUE_SIZE - 1; } for (; qb != qe; ) { const int u = que[qb]; ++qb &= QUE_SIZE - 1; for (int &i = cur[u]; ~i; i = next[i]) { if (capa[i] > 0) { const int v = zu[i]; if (cost[i] + pot[u] - pot[v] < 0) { const Capa c = min(ex[u], capa[i]); if (ex[v] <= 0 && ex[v] + c > 0) { que[qe] = v; ++qe &= QUE_SIZE - 1; } ex[u] -= c; ex[v] += c; capa[i] -= c; capa[i ^ 1] += c; if (ex[u] == 0) break; } } } if (ex[u] > 0) { bool relabeled = false; for (int i = ptr[u]; ~i; i = next[i]) { if (capa[i] > 0) { const Cost p = pot[zu[i]] - cost[i] - eps; if (!relabeled || pot[u] < p) { relabeled = true; pot[u] = p; } } } cur[u] = ptr[u]; que[qe] = u; ++qe &= QUE_SIZE - 1; } } } Cost totalCost = 0; for (int i = 0; i < m; i += 2) totalCost += cost[i] * capa[i ^ 1]; return totalCost / (n + 1); } } // namespace MCF int M, N, K, L; vector<int> X, Y, Z; int main() { for (; ~scanf("%d%d%d%d", &M, &N, &K, &L); ) { X.resize(L); Y.resize(L); Z.resize(L); for (int i = 0; i < L; ++i) { scanf("%d%d%d", &X[i], &Y[i], &Z[i]); --X[i]; --Y[i]; } MCF::init(1 + M + N); for (int u = 0; u < M; ++u) { MCF::ae(0, 1 + u, 1, 0); } for (int v = 0; v < N; ++v) { MCF::ae(1 + M + v, 0, 1, 0); } for (int i = 0; i < L; ++i) { MCF::ae(1 + X[i], 1 + M + Y[i], 1, -(1LL << Z[i])); } const Int ans = -MCF::solve(); printf("%lld\n", ans); } return 0; }