結果

問題 No.1678 Coin Trade (Multiple)
ユーザー sata shunsata shun
提出日時 2021-09-10 22:09:03
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,123 ms / 5,000 ms
コード長 5,610 bytes
コンパイル時間 2,251 ms
コンパイル使用メモリ 215,192 KB
実行使用メモリ 16,444 KB
最終ジャッジ日時 2023-09-02 17:58:41
合計ジャッジ時間 20,370 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,368 KB
testcase_01 AC 2 ms
4,368 KB
testcase_02 AC 1 ms
4,368 KB
testcase_03 AC 90 ms
10,800 KB
testcase_04 AC 508 ms
13,940 KB
testcase_05 AC 201 ms
15,764 KB
testcase_06 AC 150 ms
15,192 KB
testcase_07 AC 491 ms
11,584 KB
testcase_08 AC 313 ms
12,264 KB
testcase_09 AC 222 ms
15,908 KB
testcase_10 AC 104 ms
7,396 KB
testcase_11 AC 379 ms
13,604 KB
testcase_12 AC 91 ms
7,692 KB
testcase_13 AC 857 ms
15,420 KB
testcase_14 AC 256 ms
10,368 KB
testcase_15 AC 275 ms
13,372 KB
testcase_16 AC 66 ms
12,956 KB
testcase_17 AC 235 ms
15,908 KB
testcase_18 AC 2 ms
4,368 KB
testcase_19 AC 2 ms
4,368 KB
testcase_20 AC 2 ms
4,372 KB
testcase_21 AC 1 ms
4,368 KB
testcase_22 AC 2 ms
4,368 KB
testcase_23 AC 2 ms
4,368 KB
testcase_24 AC 2 ms
4,372 KB
testcase_25 AC 2 ms
4,372 KB
testcase_26 AC 2 ms
4,372 KB
testcase_27 AC 2 ms
4,368 KB
testcase_28 AC 1 ms
4,368 KB
testcase_29 AC 1 ms
4,372 KB
testcase_30 AC 2 ms
4,372 KB
testcase_31 AC 2 ms
4,368 KB
testcase_32 AC 2 ms
4,368 KB
testcase_33 AC 2 ms
4,372 KB
testcase_34 AC 2 ms
4,368 KB
testcase_35 AC 1 ms
4,372 KB
testcase_36 AC 1 ms
4,368 KB
testcase_37 AC 2 ms
4,368 KB
testcase_38 AC 0 ms
4,368 KB
testcase_39 AC 2 ms
4,368 KB
testcase_40 AC 2 ms
4,368 KB
testcase_41 AC 2 ms
4,368 KB
testcase_42 AC 2 ms
4,372 KB
testcase_43 AC 2 ms
4,368 KB
testcase_44 AC 2 ms
4,368 KB
testcase_45 AC 2 ms
4,372 KB
testcase_46 AC 2 ms
4,372 KB
testcase_47 AC 2 ms
4,368 KB
testcase_48 AC 1,050 ms
16,116 KB
testcase_49 AC 1,087 ms
16,320 KB
testcase_50 AC 1,057 ms
16,284 KB
testcase_51 AC 1,123 ms
16,428 KB
testcase_52 AC 1,105 ms
16,252 KB
testcase_53 AC 1,118 ms
16,444 KB
testcase_54 AC 1,100 ms
16,444 KB
testcase_55 AC 1,053 ms
16,172 KB
testcase_56 AC 1,067 ms
16,304 KB
testcase_57 AC 1,052 ms
16,276 KB
testcase_58 AC 386 ms
12,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class C, class D>  // capacity, distance
struct MinCostFlow {
    struct edge {
        int to, rev;
        C cap;
        D cost;
        edge(int to, C cap, D cost, int rev)
            : to(to), cap(cap), cost(cost), rev(rev){};
    };

    using E = edge;

    const D INF = numeric_limits<D>::max() / D(3);

    int n;
    VV<E> g;
    V<D> h, dst;
    V<int> prevv, preve;

    MinCostFlow(int n) : n(n), g(n), h(n), dst(n), prevv(n), preve(n) {}

    void add_edge(int f, int t, C cap, D cost) {
        g[f].emplace_back(t, cap, cost, (int)g[t].size());
        g[t].emplace_back(f, 0, -cost, (int)g[f].size() - 1);
    }

    // true : no negative cycle
    void init_dag(V<int>& a, VV<int>& g) {
        fill(h.begin(), h.end(), INF);
        h[0] = 0;
        rep(i, n - 1) {
            if (i + 1 < n) {
                chmin(h[i + 1], h[i]);
            }
            for (auto to : g[i]) {
                chmin(h[to], h[i] - a[to] + a[i]);
            }
        }
    }

    bool init_negative(int s) {
        fill(h.begin(), h.end(), INF);
        h[s] = 0;
        for (int t = 0; t <= n; ++t) {
            for (int i = 0; i < n; ++i) {
                for (auto e : g[i]) {
                    if (!e.cap) continue;
                    if (h[e.to] > h[i] + e.cost && t == n) {
                        return false;
                    }
                    h[e.to] = min(h[e.to], h[i] + e.cost);
                }
            }
        }
        return true;
    }

    D exec(int s, int t, C f) {
        D res = 0;
        using Data = pair<D, int>;
        while (f > 0) {
            priority_queue<Data, vector<Data>, greater<Data>> que;
            fill(dst.begin(), dst.end(), INF);
            dst[s] = 0;
            que.push(Data(0, s));

            while (!que.empty()) {
                auto p = que.top();
                que.pop();
                int v = p.second;
                if (dst[v] < p.first) continue;

                rep(i, g[v].size()) {
                    auto e = g[v][i];
                    D nd = dst[v] + e.cost + h[v] - h[e.to];
                    if (e.cap > 0 && dst[e.to] > nd) {
                        dst[e.to] = nd;
                        prevv[e.to] = v;
                        preve[e.to] = i;
                        que.push(Data(dst[e.to], e.to));
                    }
                }
            }

            if (dst[t] == INF) return D(-INF);
            rep(i, n) if (dst[i] != INF) h[i] += dst[i];

            C d = f;
            for (int v = t; v != s; v = prevv[v]) {
                d = min(d, g[prevv[v]][preve[v]].cap);
            }
            f -= d;
            res += d * h[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;
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    MinCostFlow<ll, ll> g(N + 1);
    VV<int> B(N);
    V<int> A(N);
    rep(i, N) {
        cin >> A[i];
        int k;
        cin >> k;
        rep(j, k) {
            int v;
            cin >> v;
            --v;
            g.add_edge(v, i, 1, -(A[i] - A[v]));
            B[v].pb(i);
        }
        if (i + 1 < N) g.add_edge(i, i + 1, K * 2, 0);
    }
    g.init_dag(A, B);
    auto f = g.exec(0, N - 1, K);
    cout << -f << endl;
    return 0;
}
0