#557622 (C++17) No.1288 yuki collection

• 問題: No.1288 yuki collection
• ユーザー: ei1333333
• 提出日時: 2020-09-24 22:27:19
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 410 ms / 5,000 ms
• コード長: 3,736 bytes
• コンパイル時間: 2,628 ms
• コンパイル使用メモリ: 221,180 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-28 05:52:30
• 合計ジャッジ時間: 9,970 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	3 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	278 ms; 5,376 KB
testcase_14	AC	283 ms; 5,376 KB
testcase_15	AC	224 ms; 5,376 KB
testcase_16	AC	226 ms; 5,376 KB
testcase_17	AC	283 ms; 5,376 KB
testcase_18	AC	288 ms; 5,376 KB
testcase_19	AC	286 ms; 5,376 KB
testcase_20	AC	286 ms; 5,376 KB
testcase_21	AC	276 ms; 5,376 KB
testcase_22	AC	274 ms; 5,376 KB
testcase_23	AC	274 ms; 5,376 KB
testcase_24	AC	292 ms; 5,376 KB
testcase_25	AC	288 ms; 5,376 KB
testcase_26	AC	287 ms; 5,376 KB
testcase_27	AC	153 ms; 5,376 KB
testcase_28	AC	172 ms; 5,376 KB
testcase_29	AC	154 ms; 5,376 KB
testcase_30	AC	13 ms; 5,376 KB
testcase_31	AC	18 ms; 5,376 KB
testcase_32	AC	20 ms; 5,376 KB
testcase_33	AC	158 ms; 5,376 KB
testcase_34	AC	264 ms; 5,376 KB
testcase_35	AC	250 ms; 5,376 KB
testcase_36	AC	410 ms; 5,376 KB
testcase_37	AC	375 ms; 5,376 KB
testcase_38	AC	184 ms; 5,376 KB
testcase_39	AC	139 ms; 5,376 KB
testcase_40	AC	5 ms; 5,376 KB
testcase_41	AC	2 ms; 5,376 KB
testcase_42	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>

using namespace std;


template< typename CapType, typename CostType >
class MinCostFlowDAG {
public:
  using Cat = CapType;
  using Cot = CostType;
  using pti = pair< Cot, int >;
  struct edge {
    int to, rev;
    Cat cap;
    Cot cost;
  };
  const int V;
  const Cot inf;
  vector< vector< edge > > G;
  vector< Cot > h, dist;
  vector< int > deg, ord, prevv, preve;

  MinCostFlowDAG(const int node_size) : V(node_size), inf(numeric_limits< Cot >::max()),
                                        G(V), h(V, inf), dist(V), deg(V, 0), prevv(V), preve(V) {}

  void add_edge(const int from, const int to, const Cat cap, const Cot 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];
  }

  bool tsort() {
    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) {
    priority_queue< pti, vector< pti >, greater< pti > > que;
    fill(dist.begin(), dist.end(), inf);
    dist[s] = 0;
    que.push(pti(0, s));
    while(!que.empty()) {
      pti p = que.top();
      que.pop();
      const int v = p.second;
      if(dist[v] < p.first) continue;
      for(int i = 0; i < (int) G[v].size(); ++i) {
        edge &e = G[v][i];
        if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {
          dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
          prevv[e.to] = v, preve[e.to] = i;
          que.push(pti(dist[e.to], e.to));
        }
      }
    }
  }

  void update(const int s, const int t, Cat &f, Cot &res) {
    for(int i = 0; i < V; i++) {
      if(dist[i] != inf) h[i] += dist[i];
    }
    Cat 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;
    }
  }

  Cot solve(const int s, const int t, Cat f) {
    if(!tsort()) assert(false); // not DAG
    calc_potential(s);
    Cot res = 0;
    while(f > 0) {
      Dijkstra(s);
      if(dist[t] == inf) return -1;
      update(s, t, f, res);
    }
    return res;
  }
};


int main() {
  int N;
  cin >> N;
  string S;
  cin >> S;
  vector< int > V(N);
  for(auto &v : V) cin >> v;


  MinCostFlowDAG< int64_t, int64_t > flow(N + N + N + 2);
  int X = N + N + N;
  int Y = X + 1;
  for(int i = 1; i < N; i++) {
    flow.add_edge(i - 1, i, flow.inf, 0);
    flow.add_edge(i - 1 + N, i + N, flow.inf, 0);
    flow.add_edge(i - 1 + N + N, i + N + N, flow.inf, 0);
  }
  for(int i = 0; i < N; i++) {
    if(S[i] == 'y') {
      flow.add_edge(X, i, 1, -V[i]);
    } else if(S[i] == 'u') {
      flow.add_edge(i, i + N, 1, -V[i]);
    } else if(S[i] == 'k') {
      flow.add_edge(i + N, i + N + N, 1, -V[i]);
    } else {
      flow.add_edge(i + N + N, Y, 1, -V[i]);
    }
  }
  flow.tsort();
  flow.calc_potential(X);
  int64_t cost = 0, best = 0;
  for(;;) {
    flow.Dijkstra(X);
    if(flow.dist[Y] == flow.inf) break;
    int64_t uku = 1;
    flow.update(X, Y, uku, cost);
    best = min(best, cost);
  }
  cout << -best << "\n";
}