結果

問題 No.1984 [Cherry 4th Tune *] Dilemma
ユーザー SSRS
提出日時 2022-06-17 22:02:59
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,407 bytes
コンパイル時間 2,184 ms
コンパイル使用メモリ 184,544 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 14:00:28
合計ジャッジ時間 8,068 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 42 WA * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
template <typename Cap>
struct dinic{
  struct edge{
    int to, rev;
    Cap cap;
    edge(int to, int rev, Cap cap): to(to), rev(rev), cap(cap){
    }
  };
  int N;
  vector<vector<edge>> G;
  dinic(int N): N(N), G(N){
  }
  void add_edge(int from, int to, Cap cap){
    G[from].push_back(edge(to, G[to].size(), cap));
    G[to].push_back(edge(from, G[from].size() - 1, 0));
  }
  Cap dfs(vector<int> &d, vector<int> &iter, int v, int t, Cap f){
    if (v == t){
      return f; 
    }
    while (iter[v] < G[v].size()){
      int w = G[v][iter[v]].to;
      if (G[v][iter[v]].cap > 0 && d[v] < d[w]){
        Cap f2 = dfs(d, iter, w, t, min(f, G[v][iter[v]].cap));
        if (f2 > 0){
          G[v][iter[v]].cap -= f2;
          G[w][G[v][iter[v]].rev].cap += f2;
          return f2;
        }
      }
      iter[v]++;
    }
    return 0;
  }
  Cap max_flow(int s, int t){
    Cap flow = 0;
    while (true){
      vector<int> d(N, -1);
      d[s] = 0;
      queue<int> Q;
      Q.push(s);
      while (!Q.empty()){
        if (d[t] != -1){
          break;
        }
        int v = Q.front();
        Q.pop();
        for (auto &e : G[v]){
          int w = e.to;
          if (e.cap > 0 && d[w] == -1){
            d[w] = d[v] + 1;
            Q.push(w);
          }
        }
      }
      if (d[t] == -1){
        break;
      }
      vector<int> iter(N, 0);
      while (true){
        Cap f = dfs(d, iter, s, t, INF);
        if (f == 0){
          break;
        }
        flow += f;
      }
    }
    return flow;
  }
};
int main(){
  int N, M, K, P;
  cin >> N >> M >> K >> P;
  long long sum = 0;
  dinic<long long> G(N + M + K + 2);
  for (int i = 0; i < N; i++){
    int E;
    cin >> E;
    sum += E;
    G.add_edge(N + M + K, i, E);
  }
  for (int i = 0; i < M; i++){
    int F;
    cin >> F;
    sum += F;
    G.add_edge(N + i, N + M + K + 1, F);
  }
  for (int i = 0; i < K; i++){
    int V;
    cin >> V;
    G.add_edge(N + M + i, N + M + K + 1, V);
  }
  for (int i = 0; i < N; i++){
    int L;
    cin >> L;
    for (int j = 0; j < L; j++){
      int A;
      cin >> A;
      A--;
      G.add_edge(i, N + M + A, INF);
    }
  }
  for (int i = 0; i < P; i++){
    int I, J;
    cin >> I >> J;
    I--;
    J--;
    G.add_edge(I, N + J, INF);
    G.add_edge(N + J, I, INF);
  }
  long long F = G.max_flow(N + M + K, N + M + K + 1);
  long long C = sum - F;
  vector<bool> used(N + M + K + 2, false);
  used[N + M + K] = true;
  queue<int> Q;
  Q.push(N + M + K);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    for (auto e : G.G[v]){
      if (e.cap > 0 && !used[e.to]){
        used[e.to] = true;
        Q.push(e.to);
      }
    }
  }
  assert(!used[N + M + K + 1]);
  vector<int> ans;
  for (int i = N + M; i < N + M + K; i++){
    if (used[i]){
      ans.push_back(i);
    }
  }
  for (int i = N; i < N + M; i++){
    if (!used[i]){
      ans.push_back(i);
    }
  }
  for (int i = 0; i < N; i++){
    if (used[i]){
      ans.push_back(i);
    }
  }
  int T = ans.size();
  cout << C << endl;
  cout << T << endl;
  for (int i = 0; i < T; i++){
    if (ans[i] < N){
      cout << "Goal " << ans[i] + 1 << endl;
    } else if (ans[i] < N + M){
      cout << "Action " << ans[i] - N + 1 << endl;
    } else {
      cout << "Preparation " << ans[i] - N - M + 1 << endl;
    }
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0