#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; namespace { using Integer = long long; //__int128; template istream& operator >> (istream& is, pair& p){return is >> p.first >> p.second;} template istream& operator >> (istream& is, vector& vec){for(T& val: vec) is >> val; return is;} template istream& operator , (istream& is, T& val){ return is >> val;} template ostream& operator << (ostream& os, const pair& p){return os << p.first << " " << p.second;} template ostream& operator << (ostream& os, const vector& vec){for(size_t i=0; i ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template void print(const H& head){ cout << head; } template void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template void println(const T& ... values){ print(values...); cout << endl; } template void eprint(const H& head){ cerr << head; } template void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast(chrono::steady_clock::now().time_since_epoch()).count()); template string join(const vector& v, const string& sep){ stringstream ss; for(size_t i=0; i0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; typedef struct{ int to; int cap; int rev; }edge; // node v : distance from s => level[v] void bfs(vector > &G, vector &level, int s){ fill(level.begin(), level.end(), -1); queue q; q.push(s); level[s] = 0; while(!q.empty()){ int e=q.front(); q.pop(); for(int i=0; i 0 && level[G[e][i].to] < 0){ level[G[e][i].to] = level[e] + 1; q.push(G[e][i].to); } } } } int dfs(vector > &G, vector &level, vector &used, vector &iter, int s, int f, int t){ if(s==t) return f; else{ //iter[e] : done searching from v[0] to v[ iter[e]-1 ] for(int &i=iter[s]; i 0 && level[s] < level[ G[s][i].to ]){ int d = dfs(G, level, used, iter, G[s][i].to, min(f, G[s][i].cap), t); if(d>0){ G[s][i].cap -= d; G[ G[s][i].to ][ G[s][i].rev ].cap += d; return d; } } } return 0; } } int dinic_maxflow(vector > &G, int s, int t){ const int INF = 100000000; int flow=0; while(true){ vector level(G.size(), -1); vector iter(G.size(), 0); vector used(G.size(), false); bfs(G, level, s); if(level[t] < 0) return flow; //unable to achieve to t while(true){ int f = dfs(G, level, used, iter, s, INF, t); if(f==0) break; else flow += f; } } } void add_edge(vector > &G, int from, int to, int cap){ G[from].push_back((edge){to, cap, (int)G[to].size()}); G[to].push_back((edge){from, 0, (int)G[from].size() - 1}); } int main(){ int h,w,n; cin >> h,w,n; vector ss(h); cin >> ss; vector cnt(w, 0); for(auto i : range(h) ){ for(auto j : range(w) ){ cnt[j] += ss[i][j] == '#'; } } vector c(n); cin >> c; vector> G(w + 2*n + 4); int s = w+2*n + 0; int t = w+2*n + 1; int S = w+2*n + 2; int T = w+2*n + 3; for(int i : range(n)){ int u = w+i; int v = w+n+i; add_edge(G, s, u, 9); add_edge(G, u, v, 9-1); add_edge(G, u, T, 1); add_edge(G, S, v, 1); add_edge(G, S, s, 1e7); add_edge(G, t, T, 1e7); for(int j=c[i]; j> kuso(n, vector(3, 0)); for(auto i : range(w+n, w+n+n)){ for(auto e : G[i]){ if( e.to < w ){ int d = e.to - c[i-w-n]; kuso[i-w-n][d] = 3-e.cap; } } } vector> p(n, vector(3, string(3, '.'))); for(int i : range(n)){ for(int d : range(3)){ for(int k : range(kuso[i][d])){ p[i][k][d] = '#'; } } } vector aho = {"...", "..." , "..."}; // vector unko(w, 0); // for(auto i : range(h) ){ // for(auto j : range(w) ){ // cnt[j] += ss[i][j] == '#'; // } // } for(auto i : range(n) ){ println(join(p[i], "\n")); //assert(p[i] != aho); } return 0; }