結果
問題 | No.177 制作進行の宮森あおいです! |
ユーザー |
![]() |
提出日時 | 2015-04-03 00:03:57 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 11 ms / 2,000 ms |
コード長 | 2,612 bytes |
コンパイル時間 | 878 ms |
コンパイル使用メモリ | 103,588 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-04 01:28:50 |
合計ジャッジ時間 | 1,511 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))#define rrep(X,Y) for (int (X) = (Y-1);(X) >=0;--(X))#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))#define peat(X,Y) for (;(X) < (Y);++(X))#define all(X) (X).begin(),(X).end()#define rall(X) (X).rbegin(),(X).rend()using namespace std;typedef long long ll;typedef pair<int,int> pii;typedef pair<ll,ll> pll;template<class T> using vv=vector<vector<T>>;template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}typedef int Cost;struct Edge{int to,cap,rev;Cost cost;};typedef vector<Edge> Edges;typedef vector<vector<Edge> > Graph;void add_edge(Graph &g,int from,int to,int cap,Cost cost=0){g[from].pb((Edge){to,cap,(int)g[to].size(),cost});g[to].pb((Edge){from,0,(int)g[from].size()-1,-cost});}Cost INF=1e7;vector<int> used;int dfs(Graph &g,int v,int t,int f){if(v==t) return f;used[v]=1;int re,i,j,k;for(i=0;i<g[v].size();i++){Edge &e=g[v][i];if(e.cap<=0||used[e.to])continue;int d=dfs(g,e.to,t,min(f,e.cap));if(d>0){e.cap-=d;g[e.to][e.rev].cap+=d;return d;}}return 0;}int max_flow(Graph &g,int s,int t){int sum=0,f,V=g.size();while(1){used.resize(V);fill(all(used),0);sum+=f=dfs(g,s,t,INF);if(!f)return sum;}}int main(){ios_base::sync_with_stdio(false);cout<<fixed<<setprecision(0);int i,j,k;int w,n,m;cin>>w>>n;vector<int> a(n);rep(i,n) cin>>a[i];cin>>m;vector<int> b(m);rep(i,m) cin>>b[i];Graph g(n+m+2);rep(i,n)add_edge(g,n+m,i,a[i]);rep(i,m)add_edge(g,n+i,n+m+1,b[i]);ll num,ng,tmp;rep(i,m){ng=0;cin>>num;rep(j,num){cin>>tmp; --tmp;ng|=1ll<<tmp;}//cout<<i<<":";rep(j,n){if(ng>>j&1)continue;//cout<<j<<",";add_edge(g,j,n+i,INF);}//cout<<endl;}//cout<<max_flow(g,n+m,n+m+1)<<endl;cout<<(max_flow(g,n+m,n+m+1)>=w?"SHIROBAKO":"BANSAKUTSUKITA")<<endl;return 0;}