結果

問題 No.1678 Coin Trade (Multiple)
ユーザー keijakkeijak
提出日時 2021-09-13 22:05:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,047 ms / 5,000 ms
コード長 6,257 bytes
コンパイル時間 5,500 ms
コンパイル使用メモリ 283,944 KB
実行使用メモリ 13,916 KB
最終ジャッジ日時 2024-06-25 23:14:39
合計ジャッジ時間 21,776 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 62 ms
7,480 KB
testcase_04 AC 502 ms
10,880 KB
testcase_05 AC 192 ms
12,416 KB
testcase_06 AC 128 ms
11,804 KB
testcase_07 AC 352 ms
8,232 KB
testcase_08 AC 228 ms
9,132 KB
testcase_09 AC 199 ms
12,672 KB
testcase_10 AC 30 ms
5,376 KB
testcase_11 AC 305 ms
10,460 KB
testcase_12 AC 25 ms
5,376 KB
testcase_13 AC 767 ms
12,092 KB
testcase_14 AC 156 ms
7,336 KB
testcase_15 AC 214 ms
10,248 KB
testcase_16 AC 53 ms
10,112 KB
testcase_17 AC 199 ms
12,672 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 1 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 2 ms
5,376 KB
testcase_39 AC 2 ms
5,376 KB
testcase_40 AC 2 ms
5,376 KB
testcase_41 AC 2 ms
5,376 KB
testcase_42 AC 2 ms
5,376 KB
testcase_43 AC 2 ms
5,376 KB
testcase_44 AC 2 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 1,039 ms
13,072 KB
testcase_49 AC 984 ms
13,056 KB
testcase_50 AC 1,016 ms
12,936 KB
testcase_51 AC 1,002 ms
12,948 KB
testcase_52 AC 986 ms
13,184 KB
testcase_53 AC 1,042 ms
13,084 KB
testcase_54 AC 1,026 ms
13,064 KB
testcase_55 AC 1,033 ms
13,056 KB
testcase_56 AC 1,047 ms
13,060 KB
testcase_57 AC 1,039 ms
13,076 KB
testcase_58 AC 365 ms
13,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

#include <atcoder/mincostflow>
#include <boost/heap/fibonacci_heap.hpp>

#define REP_(i, a_, b_, a, b, ...) \
  for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;

template<typename T, typename U>
inline bool chmax(T &a, U b) {
  return a < b and ((a = std::move(b)), true);
}
template<typename T, typename U>
inline bool chmin(T &a, U b) {
  return a > b and ((a = std::move(b)), true);
}
template<typename T>
inline int ssize(const T &a) {
  return (int) std::size(a);
}

template<typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (auto &x: a) is >> x;
  return is;
}
template<typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
  return os << "(" << a.first << ", " << a.second << ")";
}
template<typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
                        std::string_view ends = "\n",
                        std::ostream &os = std::cout) {
  auto b = std::begin(a), e = std::end(a);
  for (auto it = std::begin(a); it != e; ++it) {
    if (it != b) os << sep;
    os << *it;
  }
  return os << ends;
}
template<typename T, typename = void>
struct is_iterable : std::false_type {};
template<typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {
};

template<typename T, typename = std::enable_if_t<
    is_iterable<T>::value &&
        !std::is_same<T, std::string_view>::value &&
        !std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
  return print_seq(a, ", ", "", (os << "{")) << "}";
}

void print() { std::cout << "\n"; }
template<class T>
void print(const T &x) {
  std::cout << x << "\n";
}
template<typename Head, typename... Tail>
void print(const Head &head, Tail... tail) {
  std::cout << head << " ";
  print(tail...);
}

struct Input {
  template<typename T>
  operator T() const {
    T x;
    std::cin >> x;
    return x;
  }
} in;

#ifdef MY_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif

using namespace std;

template<typename Cap, typename Cost>
class MinCostFlowDAG {
 public:
  static constexpr Cost INF = std::numeric_limits<Cost>::max() / 4;

  struct Edge {
    int to, rev;
    Cap cap;
    Cost cost;
  };

  const int V;
  std::vector<vector<Edge>> G;
  std::vector<Cost> h, dist;
  std::vector<int> deg, ord, prevv, preve;

  explicit MinCostFlowDAG(int node_count)
      : V(node_count),
        G(V),
        h(V, INF),
        dist(V, 0),
        deg(V, 0),
        prevv(V),
        preve(V) {}

  void add_edge(const int from, const int to, const Cap cap, const Cost cost) {
    if (cap == 0) return;
    G[from].push_back(Edge{to, (int) G[to].size(), cap, cost});
    G[to].push_back(Edge{from, (int) G[from].size() - 1, 0, -cost});
    ++deg[to];
  }

  std::optional<Cost> flow(const int s, const int t, Cap f) {
    assert(topological_sort());  // must be a DAG.
    calc_potential(s);
    Cost res = 0;
    while (f > 0) {
      dijkstra(s);
      if (dist[t] == INF) return std::nullopt;
      update(s, t, f, res);
    }
    return res;
  }

 private:
  // using DijkstraState = pair<Cost, int>;

  struct DijkstraState {
    Cost dist;
    int node;
  };
  friend bool operator>(const DijkstraState &x, const DijkstraState &y) {
    return x.dist > y.dist;
  }
  friend bool operator<(const DijkstraState &x, const DijkstraState &y) {
    return x.dist < y.dist;
  }

  bool topological_sort() {
    queue<int> que;
    for (int i = 0; i < V; ++i) {
      if (deg[i] == 0) que.push(i);
    }
    while (!que.empty()) {
      const int p = que.front();
      que.pop();
      ord.push_back(p);
      for (auto &e: G[p]) {
        if (e.cap > 0 && --deg[e.to] == 0) que.push(e.to);
      }
    }
    return (*max_element(deg.begin(), deg.end()) == 0);
  }

  void calc_potential(const int s) {
    h[s] = 0;
    for (const int v: ord) {
      if (h[v] == INF) continue;
      for (const Edge &e: G[v]) {
        if (e.cap > 0) h[e.to] = min(h[e.to], h[v] + e.cost);
      }
    }
  }

  void dijkstra(const int s) {
    using Heap = boost::heap::fibonacci_heap<
        DijkstraState, boost::heap::compare<std::greater<DijkstraState>>>;
    Heap heap;
    fill(dist.begin(), dist.end(), INF);
    dist[s] = 0;
    vector<optional<typename Heap::handle_type>> handles(V);
    handles[s] = heap.push({dist[s], s});

    while (not heap.empty()) {
      const auto cur = heap.top();
      heap.pop();
      const int v = cur.node;
      if (dist[v] < cur.dist) continue;
      for (int i = 0; i < (int) G[v].size(); ++i) {
        const Edge &e = G[v][i];
        const Cost new_dist = dist[v] + e.cost + h[v] - h[e.to];
        if (e.cap > 0 and dist[e.to] > new_dist) {
          dist[e.to] = new_dist;
          prevv[e.to] = v;
          preve[e.to] = i;
          if (handles[e.to]) {
            heap.update(*handles[e.to], {new_dist, e.to});
          } else {
            handles[e.to] = heap.push({new_dist, e.to});
          }
        }
      }
    }
  }

  void update(const int s, const int t, Cap &f, Cost &res) {
    for (int i = 0; i < V; i++) {
      if (dist[i] != INF) h[i] += dist[i];
    }
    Cap d = f;
    for (int v = t; v != s; v = prevv[v]) {
      d = min(d, G[prevv[v]][preve[v]].cap);
    }
    f -= d;
    res += h[t] * d;
    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;
    }
  }
};

auto solve() {
  const int n = in, K = in;
  vector<i64> a(n);
  MinCostFlowDAG<int, i64> g(n);
  REP(i, n) {
    a[i] = in;
    int m = in;
    REP(j, m) {
      int b = in;
      --b;
      i64 cost = a[b] - a[i];
      if (cost < 0) {
        g.add_edge(b, i, 1, cost);
      }
    }
  }
  REP(i, n - 1) { g.add_edge(i, i + 1, K, 0); }
  auto ans = g.flow(0, n - 1, K);
  assert(ans.has_value());
  return -ans.value();
}

int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  auto ans = solve();
  print(ans);
}
0