結果

問題 No.1427 Simplified Tetris
ユーザー haruki_Kharuki_K
提出日時 2021-03-13 01:08:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 18 ms / 2,000 ms
コード長 10,762 bytes
コンパイル時間 2,919 ms
コンパイル使用メモリ 226,120 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-22 15:53:32
合計ジャッジ時間 4,265 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 5 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 3 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 2 ms
6,940 KB
testcase_16 AC 2 ms
6,940 KB
testcase_17 AC 2 ms
6,940 KB
testcase_18 AC 2 ms
6,944 KB
testcase_19 AC 5 ms
6,940 KB
testcase_20 AC 2 ms
6,944 KB
testcase_21 AC 2 ms
6,944 KB
testcase_22 AC 2 ms
6,944 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 AC 2 ms
6,944 KB
testcase_25 AC 2 ms
6,944 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 1 ms
6,944 KB
testcase_28 AC 2 ms
6,944 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 1 ms
6,940 KB
testcase_31 AC 4 ms
6,940 KB
testcase_32 AC 12 ms
6,944 KB
testcase_33 AC 4 ms
6,940 KB
testcase_34 AC 1 ms
6,940 KB
testcase_35 AC 2 ms
6,940 KB
testcase_36 AC 18 ms
6,944 KB
testcase_37 AC 2 ms
6,940 KB
testcase_38 AC 13 ms
6,944 KB
testcase_39 AC 4 ms
6,944 KB
testcase_40 AC 16 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
vector<int> &operator--(vector<int> &v) { for (int &x : v) --x; return v; }
vector<int> &operator++(vector<int> &v) { for (int &x : v) ++x; return v; }
// <<<
// >>> Dinic
template <class Flow>
struct Dinic {
    static constexpr Flow INF = numeric_limits<Flow>::max();
    static constexpr Flow EPS = 1e-10; //

    struct Edge {
        int32_t to, rev, id;
        Flow cap;
        Edge(int to, int rev, int id, Flow cap)
            : to(to), rev(rev), id(id), cap(cap) {}
    };
    vector<vector<Edge>> g;
    vector<pair<int32_t, int32_t>> es;
    vector<int32_t> level, iter;
    int V, E, s, t;

    Dinic(int V = 0) : g(V), V(V), E(0), s(-1), t(-1) {}
    void add_edge(int from, int to, Flow cap) {
        assert(0 <= from); assert(from < V);
        assert(0 <= to); assert(to < V);
        assert(cap >= 0);
        es.emplace_back(from, g[from].size());
        g[from].emplace_back(to, g[to].size(), E, cap);
        g[to].emplace_back(from, g[from].size()-1, E, 0);
        E++;
    }

    struct edge_t {
        int32_t from, to;
        Flow flow, cap;
    };
    Edge& internal_edge(int id) {
        assert(0 <= id); assert(id < (int)es.size());
        int from, idx; tie(from, idx) = es[id];
        return g[from][idx];
    }
    edge_t edge(int id) const {
        assert(0 <= id); assert(id < (int)es.size());
        int32_t from, idx; tie(from, idx) = es[id];
        auto const& e = g[from][idx];
        auto const& r = g[e.to][e.rev];
        return { from, e.to, r.cap, e.cap+r.cap };
    }
    vector<edge_t> edges() const {
        vector<edge_t> ret(E);
        rep (id, E) ret[id] = edge(id);
        return ret;
    }

    bool bfs() {
        level.assign(V, -1);
        queue<int> q;
        level[s] = 0;
        q.push(s);
        while (q.size() && level[t] < 0) {
            int x = q.front(); q.pop();
            for (auto const& e : g[x]) {
                if (e.cap > EPS && level[e.to] < 0) {
                    level[e.to] = level[x] + 1;
                    q.push(e.to);
                }
            }
        }
        return level[t] >= 0;
    }

    Flow dfs(int x, Flow f = INF) {
        if (x == t) return f;
        Flow res = 0;
        for (auto &i = iter[x]; i < int(g[x].size()); ++i) {
            auto &e = g[x][i];
            if (e.cap > EPS && level[x] < level[e.to]) {
                Flow d = dfs(e.to, min(f, e.cap));
                e.cap -= d;
                g[e.to][e.rev].cap += d;
                res += d;
                f -= d;
                if (f == 0) break;
            }
        }
        return res;
    }

    Flow max_flow(int s, int t) {
        assert(0 <= s); assert(s < V);
        assert(0 <= t); assert(t < V);
        this-> s = s; this->t = t;
        Flow flow = 0;
        while (bfs()) {
            iter.assign(V, 0);
            for (Flow f = 0; (f = dfs(s)); flow += f) {}
        }
        return flow;
    }

#ifdef LOCAL
    friend string to_s(Dinic d) {
        string ret = "\n";
        ret += "V = " + to_s(d.V) + ", E = " + to_s(d.E) + "\n";
        ret += "s = " + to_s(d.s) + ", t = " + to_s(d.t) + "\n";
        for (auto const& p : d.es) {
            auto const& e = d.g[p.first][p.second];
            auto const& r = d.g[e.to][e.rev];
            ret += to_s(e.id) + " : ";
            ret += to_s(p.first) + "->" + to_s(e.to) + " : ";
            ret += to_s(r.cap) + "/" + to_s(e.cap+r.cap) + "\n";
        }
        return ret;
    }
#endif

};
// <<<

vector<string> solve(vector<string> const& t) {
    const int n = t.size(), m = t[0].size();

    Dinic<int> g(n*m+2);
    const int S = n*m, T = S+1;
    auto id = [&](int i, int j) { return i*m + j; };
    rep (i, n) rep (j, m) if ((i+j)%2 == 0) {
        rep (dir, 4) {
            int ni = i+dx[dir];
            int nj = j+dy[dir];
            if (0 <= ni and ni < n and
                0 <= nj and nj < m) {
                g.add_edge(id(i, j), id(ni, nj), 1);
            }
        }
    }

    int cnt = 0;
    rep (i, n) rep (j, m) if (t[i][j] == '#') {
        cnt++;
        if ((i+j) % 2 == 0) {
            g.add_edge(S, id(i, j), 1);
        } else {
            g.add_edge(id(i, j), T, 1);
        }
    }

    int flow = g.max_flow(S, T);
    if (flow*2 < cnt) return {};
    assert(flow*2 == cnt);

    vector<string> ans(n, string(m, '.'));
    int ch_cnt = 0;
    auto ch = [&]() -> char {
        char ret;
        assert(ch_cnt < 26*2);
        if (ch_cnt < 26) ret = 'a'+ch_cnt;
        else ret = 'A'+(ch_cnt-26);
        ch_cnt++;
        return ret;
    };
    for (auto [from, to, flow, cap] : g.edges()) {
        if (flow < cap) continue;
        if (from == S or to == T) continue;
        int i = from/m, j = from%m;
        int ni = to/m, nj = to%m;
        char c = ch();
        ans[i][j] = c;
        ans[ni][nj] = c;
    }

    return ans;
}

int32_t main() {
    int n, m; cin >> n >> m;
    vector<string> s(n); cin >> s;
    reverse(all(s));

    vector<int> a(n);
    rep (i, n) {
        a[i] = count(all(s[i]), '#');
        if (a[i] == m) quit("No");
        a[i] = (a[i] > 0);
    }
    rep (i, n-1) if (a[i] < a[i+1]) quit("No");
    const int num = count(all(a), 1);

    rep (bit, 1<<n) if (popcnt(bit) == num) {
        vector<string> t(n, string(m, '#'));
        int j = 0, last = -1;
        rep (k, n) if (bit>>k&1) {
            t[k] = s[j++];
            last = k;
        }
        loopR (k, n-1, >= last) {
            auto ans = solve(t);
            if (ans.size()) {
                cout << "Yes" << '\n';
                repR (i, n) cout << ans[i] << '\n';
                return 0;
            }
            t[k] = string(m, '.');
        }
    }
    cout << "No" << '\n';

}
0