#include using namespace std; #define int long long #define all(x) x.begin(), x.end() struct Edge{ int u, v, w, cap, flow; }; const int INF = 0x3f3f3f3f; struct MCMF { int n; vector edges; vector> adj; vector par, dist, inque; MCMF(int _n) { n = _n; adj.resize(n+1); par.resize(n+1); dist.resize(n+1); inque.resize(n+1); } void addedge(int u, int v, int cap, int w) { adj[u].push_back(edges.size()); edges.push_back({u, v, w, cap, 0}); adj[v].push_back(edges.size()); edges.push_back({v, u, -w, cap, cap}); } void spfa(int src) { fill(par.begin(), par.end(), -1); fill(dist.begin(), dist.end(), INF); fill(inque.begin(), inque.end(), 0); dist[src] = 0; queue que({src}); while(que.size()) { int q = que.front(); que.pop(); inque[q] = 0; for(int i: adj[q]) { Edge& e = edges[i]; if(e.flow < e.cap && dist[e.v] > dist[e.u]+e.w) { dist[e.v] = dist[e.u]+e.w; par[e.v] = i; if(!inque[e.v]) { inque[e.v] = 1; que.push(e.v); } } } } } pair solve(int src, int sink) { int mc = 0, mf = 0; while(1) { spfa(src); if(par[sink] == -1) return {mc, mf}; int flow = INF, c = sink; while(c != src) { Edge &e = edges[par[c]]; flow = min(flow, e.cap-e.flow); c = e.u; } c = sink; while(c != src) { Edge &e = edges[par[c]], &ie = edges[par[c]^1]; e.flow += flow; ie.flow -= flow; c = e.u; } mf += flow; mc += dist[sink]*flow; } } }; int32_t main() { cin.tie(0)->sync_with_stdio(0); int R, C, S; cin >> R >> C; vector arr(R); for(auto &r: arr) cin >> r; cin >> S; int row_ycnt = 0; vector col_ycnt(C); for(int i=0; i row_ycnt) { return !(cout << "Bugged!"); } } int req = C + (C - row_ycnt) * R; if(req > S) return !(cout << "Bugged!"); vector> ans(R+1, vector(C)); vector col_idx(C); iota(all(col_idx), 0); sort(all(col_idx), [&](int a, int b){return col_ycnt[a] < col_ycnt[b];}); arr.push_back(string(C, 'G')); for(int i=0; i0; d--) { MCMF mcmf(R+C+4); // printf("at d = %d--------\n", d); vector> edgerec; for(int r=0; r<=R; r++) { for(int c=0; c

코드 #6108