結果

問題 No.177 制作進行の宮森あおいです！
ユーザー penguinshunya
提出日時 2019-06-06 12:19:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 23 ms / 2,000 ms
コード長 4,604 bytes
コンパイル時間 2,416 ms
コンパイル使用メモリ 205,016 KB
最終ジャッジ日時 2025-01-07 04:15:45
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) sort(all(v)); reverse(all(v))

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "SHIROBAKO" << '\n'; exit(0); }
inline void no() { cout << "BANSAKUTSUKITA" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template<typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template<typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template<typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template<typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template<typename T> inline T power(T x, i64 n) { T r = 1; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template<typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

template <typename C, typename D>
struct Graph {
  struct Edge {
    int from, to;
    C cap;
    D cost;
    int rev;
  };
  vector<vector<Edge>> G;
  int n;
  Graph(int n) : n(n) {
    G = vector<vector<Edge>>(n);
  }
  void add_edge(int u, int v, C c = 1, D d = 0) {
    G[u].push_back((Edge) { u, v, c, d, (int) G[v].size() });
    G[v].push_back((Edge) { v, u, 0, -d, (int) G[u].size() - 1 });
  }
  C max_flow(int s, int t) {
    C flow = 0;
    vector<int> used(n);
    int ui = 0;
    function<C(int, int, C)> dfs = [&](int v, int t, C f) {
      if (v == t) return f;
      used[v] = ui;
      for (int i = 0; i < G[v].size(); i++) {
        auto &e = G[v][i];
        if (used[e.to] == ui || e.cap == 0) continue;
        int d = dfs(e.to, t, min(f, e.cap));
        if (d == 0) continue;
        e.cap -= d;
        G[e.to][e.rev].cap += d;
        return d;
      }
      return 0;
    };
    while (true) {
      ui++;
      int f = dfs(s, t, numeric_limits<C>::max());
      if (f == 0) return flow;
      flow += f;
    }
  }
  D min_cost_flow(int s, int t, C f) {
    const D INF = numeric_limits<D>::max();
    D ret = 0;
    while (f > 0) {
      vector<D> dist(n, INF);
      vector<int> prevv(n), preve(n);
      dist[s] = 0;
      while (true) {
        bool update = false;
        rep(v, n) rep(i, G[v].size()) {
          auto &e = G[v][i];
          if (e.cap == 0) continue;
          if (dist[v] == INF || dist[e.to] <= dist[v] + e.cost) continue;
          dist[e.to] = dist[v] + e.cost;
          prevv[e.to] = v, preve[e.to] = i;
          update = true;
        }
        if (!update) break;
      }
      if (dist[t] == INF) return INF;
      C cap = f;
      for (int v = t; v != s; v = prevv[v]) {
        cap = min(cap, G[prevv[v]][preve[v]].cap);
      }
      f -= cap;
      ret += cap * dist[t];
      for (int v = t; v != s; v = prevv[v]) {
        auto &e = G[prevv[v]][preve[v]];
        e.cap -= cap;
        G[v][e.rev].cap += cap;
      }
    }
    return ret;
  }
};

void solve() {
  int W; cin >> W;
  int N; cin >> N;
  vi32 J(N); cin >> J;
  int M; cin >> M;
  vi32 C(M); cin >> C;
  vector<vi32> X(M);
  rep(i, M) {
    int Q; cin >> Q;
    X[i].resize(Q); cin >> X[i];
    rep(j, Q) X[i][j]--;
  }

  auto g = Graph<int, int>(N + M + 2);
  int s = N + M, t = s + 1;
  rep(i, N) {
    g.add_edge(s, i, J[i]);
  }
  rep(i, M) {
    rep(j, N) {
      bool f = true;
      each(e, X[i]) {
        if (e == j) f = false;
      }
      if (!f) continue;
      g.add_edge(j, i + N, J[j]);
    }
    g.add_edge(i + N, t, C[i]);
  }
  
  if (g.max_flow(s, t) >= W) yes(); no();
}
0