結果

問題 No.177 制作進行の宮森あおいです！
ユーザー fumiphysfumiphys
提出日時 2019-09-25 01:35:44
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 5,172 bytes
コンパイル時間 1,767 ms
コンパイル使用メモリ 183,060 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-19 14:56:21
合計ジャッジ時間 2,480 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;


template <typename T>
struct edge {int to; T cap; int rev;};

template <typename T>
struct Graph{
  int n;
  vector<vector<edge<T>>> vec;
  vector<int> level;
  vector<int> iter;
  Graph(int n): n(n){
    vec.resize(n);
    level.resize(n);
    iter.resize(n);
  }
  void adde(int at, int to, T cap){
    vec[at].push_back((edge<T>){to, cap, (int)vec[to].size()});
    vec[to].push_back((edge<T>){at, 0, (int)vec[at].size() - 1});
  }
  void bfs(int s){
    fill(level.begin(), level.end(), -1);
    level[s] = 0;
    queue<int> q;
    q.push(s);
    while(!q.empty()){
      auto p = q.front(); q.pop();
      for(auto e: vec[p]){
        if(level[e.to] < 0 && e.cap > 0){
          level[e.to] = level[p] + 1;
          q.push(e.to);
        }
      }
    }
  }
  T dfs(int v, int t, T f){
    if(v == t)return f;
    int st = iter[v];
    for(int i = st; i < vec[v].size(); i++){
      iter[v] = i;
      auto& e = vec[v][i];
      if(level[v] < level[e.to] && e.cap > 0){
        auto d = dfs(e.to, t, min(f, e.cap));
        if(d > 0){
          e.cap -= d;
          vec[e.to][e.rev].cap += d;
          return d;
        }
      }
    }
    return 0;
  }
  T max_flow(int s, int t){
    T flow = 0;
    while(true){
      bfs(s);
      if(level[t] < 0)return flow;
      fill(iter.begin(), iter.end(), 0);
      T inf = numeric_limits<T>::max();
      T f = dfs(s, t, inf);
      while(f > 0){
        flow += f;
        f = dfs(s, t, inf);
      }
    }
  }
  T min_cut(int s, int t){
    return max_flow(s, t);
  }
};

using GraphI = Graph<int>;
using GraphL = Graph<long long>;

bool ok[51][51];

int main(int argc, char const* argv[])
{
  int w;
  int n;
  cin >> w >> n;
  vector<int> j(n);
  cin >> j;
  int m;
  cin >> m;
  vector<int> c(m);
  cin >> c;
  rep(i, n){
    rep(k, m)ok[i][k] = true;
  }
  rep(i, m){
    int q;
    cin >> q;
    rep(k, q){
      int x;
      cin >> x, x--;
      ok[x][i] = false;
    }
  }
  GraphL g(2 + n + m);
  rep(i, n){
    g.adde(0, i + 1, j[i]);
  }
  rep(i, m){
    g.adde(n + 1 + i, 1 + n + m, c[i]);
  }
  rep(i, n){
    rep(k, m){
      if(ok[i][k]){
        g.adde(i + 1, 1 + n + k, inf);
      }
    }
  }
  auto f = g.min_cut(0, 1 + n + m);
  if(f >= w)cout << "SHIROBAKO" << endl;
  else cout << "BANSAKUTSUKITA" << endl;
  return 0;
}
0