結果
問題 | No.177 制作進行の宮森あおいです! |
ユーザー | tubo28 |
提出日時 | 2015-09-24 19:14:55 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,164 bytes |
コンパイル時間 | 1,575 ms |
コンパイル使用メモリ | 174,844 KB |
実行使用メモリ | 6,940 KB |
最終ジャッジ日時 | 2024-07-19 09:03:23 |
合計ジャッジ時間 | 2,428 ms |
ジャッジサーバーID (参考情報) |
judge5 / 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 | WA | - |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 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 | 2 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
ソースコード
#define _CRT_SECURE_NO_WARNINGS // #define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; typedef long long ll; // #define int ll typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int,int> pii; #define all(c) begin(c), end(c) #define range(i,a,b) for(ll i=a; i<ll(b); i++) #define rep(i,b) range(i,0,b) #define rangei(i,a,b) for(ll a=a;i<=ll(b);i++) #define repi(i,b) rangei(i,1,b) #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple template<class T> ostream & operator << (ostream &os, vector<T> const &); template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){} template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream &os, tuple<T...> const &t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); } template<class...T> ostream & operator << (ostream &os, tuple<T...> const &t){ _ot<0>(os, t); return os; } template<class T, class U> ostream & operator<<(ostream &os, pair<T,U> const &p){ return os << "(" << p.first << ", " << p.second << ") "; } template<class T> ostream & operator<<(ostream &os, vector<T> const &v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; } #ifdef DEBUG #define dump(...) (cerr << #__VA_ARGS__ << " = " << mt(__VA_ARGS__) \ << " [" << __LINE__ << "]" << endl) #else #define dump(...) #endif void fastios(){ ios_base::sync_with_stdio(0); cin.tie(0); // #define endl '\n' } template<class T> size_t uniq(vector<T> &v){ sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); return v.size(); } template<class T> size_t uniq(T *l, size_t n){ sort(l,l+n); return unique(l,l+n) - l; } #define mems(arr,val) memset(arr,val,sizeof(arr)); int const mod = 1000000007; int const inf = numeric_limits<int>::max()/8; typedef int Capacity; struct Edge { int src, dst; Capacity cap; Edge(int src_, int dst_, int cap_) : src(src_), dst(dst_), cap(cap_) { } }; typedef vector<Edge> Edges; typedef vector<Edges> Graph; typedef vector<int> Array; typedef vector<Array> Matrix; template<class Capacity = int> struct max_flow { typedef vector<vector<Capacity>> Matrix; size_t n; Matrix cap, flow; vector<bool> vis; Capacity res; max_flow(const int s, const int t, const Graph &g) : n(g.size()), cap(n, Array(n)), flow(n, Array(n)) { for(size_t i = 0; i < g.size(); i++){ for(size_t j = 0; j < g[i].size(); j++){ int u = g[i][j].src, v = g[i][j].dst; Capacity c = g[i][j].cap; cap[u][v] = flow[v][u] = c; flow[u][v] = 0; } } res = solve(s, t); } Capacity augment(const int v, const int t, Capacity lim){ vis[v] = true; if(v == t) return lim; for(size_t i = 0; i < n; i++){ if(vis[i] || cap[v][i] <= flow[v][i]) continue; Capacity f = augment(i, t, min(lim, cap[v][i] - flow[v][i])); flow[v][i] += f, flow[i][v] -= f; if(f) return f; } return 0; } Capacity solve(const int s, const int t){ Capacity res = 0, f = -1; while(f) vis.assign(n,false), res += (f = augment(s,t,inf)); return res; } }; ll W,N; ll J[60]; ll M; ll C[60]; bool ok[60][60]; int main(){ while(cin >> W){ cin >> N; rep(i,N) cin >> J[i]; cin >> M; rep(i,M) cin >> C[i]; rep(i,N)rep(j,M) ok[i][j] = true; rep(i,M){ int Q; cin >> Q; rep(j,Q){ int X; cin >> X; X--; ok[X][i] = false; } } int S = N+M, T = N+M+1; Graph g(N+M+2); rep(i,N){ g[S].eb(S,i,J[i]); } rep(i,N)rep(j,M){ if(ok[i][j]){ g[i].eb(i,N+j,min(J[i],C[j])); } } rep(i,M){ g[i+N].eb(i+N,T,C[i]); } ll f = max_flow<>(S,T,g).res; dump(f); puts(f >= W ? "SHIROBAKO" : "BANSAKUTSUKITA"); } }