結果
| 問題 |
No.1427 Simplified Tetris
|
| コンテスト | |
| ユーザー |
 heno239
|
| 提出日時 | 2021-03-12 22:21:27 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 264 ms / 2,000 ms |
| コード長 | 6,616 bytes |
| コンパイル時間 | 3,463 ms |
| コンパイル使用メモリ | 166,484 KB |
| 最終ジャッジ日時 | 2025-01-19 15:03:29 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 37 |
ソースコード
#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);
ll mod_pow(ll x, ll n, ll m = mod) {
if (n < 0) {
ll res = mod_pow(x, -n, m);
return mod_pow(res, m - 2, m);
}
if (abs(x) >= m)x %= m;
if (x < 0)x += m;
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[a - b];
}
char mp[10][10];
struct edge { int to; ll cap; int rev; };
struct Dinic {
private:
int n;
vector<vector<edge>> v;
vector<int> dist, iter;
public:
Dinic(int sz) :n(sz), v(sz), dist(sz), iter(sz) {}
void addedge(int from, int to, ll cap) {
int x = v[to].size(), y = v[from].size();
v[from].push_back({ to,cap,x });
v[to].push_back({ from,0,y });
}
void bfs(int s) {
fill(dist.begin(), dist.end(), -1);
queue<int> q;
dist[s] = 0;
q.push(s);
while (q.size()) {
int x = q.front(); q.pop();
rep(i, v[x].size()) {
edge& e = v[x][i];
if (e.cap > 0 && dist[e.to] < 0) {
dist[e.to] = dist[x] + 1;
q.push(e.to);
}
}
}
}
ll dfs(int x, int t, ll f) {
if (x == t)return f;
for (int& i = iter[x]; i < (int)v[x].size(); ++i) {
edge& e = v[x][i];
if (e.cap > 0 && dist[x] < dist[e.to]) {
ll d = dfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
v[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
ll max_flow(int s, int t) {
ll flow = 0;
while (1) {
bfs(s);
if (dist[t] < 0)return flow;
fill(iter.begin(), iter.end(), 0);
ll f;
while ((f = dfs(s, t, 1LL << 62)) > 0)flow += f;
}
}
vector<P> ps(int h,int w) {
vector<P> res;
rep(i, h)rep(j, w)if (mp[i][j] == '#')if((i+j)%2==0) {
int id = i * w + j;
for (edge e : v[id]) {
if (e.cap == 0 && e.to < h * w) {
res.push_back({ id,e.to });
}
}
}
return res;
}
};
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
void solve() {
int h, w; cin >> h >> w;
vector<string> s(h);
rep(i, h)cin >> s[i];
rep(i, h) {
int cnt = 0;
rep(j, w)if (s[i][j] == '#')cnt++;
if (cnt == w) {
cout << "No" << "\n"; return;
}
}
vector<string> t;
rep(i, h) {
bool exi = false;
rep(j, w) {
if (s[i][j] == '#')exi = true;
}
if (exi) {
while (i < h) {
t.push_back(s[i]);
i++;
}
}
}
rep(i, t.size()) {
bool exi = false;
rep(j, w)if (t[i][j] == '#')exi = true;
if (!exi) {
cout << "No\n"; return;
}
}
vector<int> v;
rep(i, h - t.size())v.push_back(0);
rep(i, t.size())v.push_back(1);
int l = h - t.size();
do {
vector<int> inds;
int tmp = 0;
rep(i, h) {
if (v[i]) {
rep(j, w) {
mp[i][j] = t[tmp][j];
}
tmp++;
}
else {
inds.push_back(i);
}
}
rep(x, (1 << l)) {
rep(k, l) {
int id = inds[k];
if (x & (1 << k)) {
rep(y, w)mp[id][y] = '#';
}
else {
rep(y, w)mp[id][y] = '.';
}
}
Dinic dc(h* w + 2);
int sta = h * w, goa = h * w + 1;
int c0 = 0, c1 = 0;
rep(i, h)rep(j, w) {
if (mp[i][j] != '#')continue;
int id = i * w + j;
if ((i + j) % 2 == 0) {
c0++;
dc.addedge(sta, id, 1);
rep(d, 4) {
int ni = i + dx[d];
int nj = j + dy[d];
if (ni < 0 || nj < 0 || ni >= h || nj >= w)continue;
dc.addedge(id, ni * w + nj, 1);
}
}
else {
c1++;
dc.addedge(id, goa, 1);
}
}
if (c0 != c1)continue;
int f = dc.max_flow(sta, goa);
if (f == c0) {
cout << "Yes\n";
vector<P> vp = dc.ps(h,w);
//cout << f<<" "<<vp.size() << "\n";
vector<string> ans(h);
rep(i, h)ans[i].resize(w,'.');
rep(i, vp.size()) {
char c = 'a' + i;
if (i >= 26)c = 'A' + (i - 26);
ans[vp[i].first / w][vp[i].first % w] = c;
ans[vp[i].second / w][vp[i].second % w] = c;
}
rep(i, h)cout << ans[i] << "\n";
return;
}
}
} while (next_permutation(all(v)));
cout << "No\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
init_f();
//init();
//expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
}