結果

問題 No.2657 Falling Block Game
コンテスト
ユーザー AngrySadEight
提出日時 2024-02-16 01:41:35
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 618 ms / 2,000 ms
コード長 5,313 bytes
コンパイル時間 21,038 ms
コンパイル使用メモリ 274,432 KB
最終ジャッジ日時 2025-02-19 13:23:12
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll INF = 100000000000000000LL;

ll op(ll a, ll b) { return min(a, b); }

ll e() { return INF; }

ll mapping(ll f, ll x) { return min(f, x); }

ll composition(ll f, ll g) { return min(f, g); }

ll id() { return INF; }

int main() {
    ll H, W;
    cin >> H >> W;
    assert(H >= 3 && H <= 100000);
    assert(W >= 1 && W <= 100000);
    assert(H * W <= 500000);
    vector<string> S(H);
    for (ll i = 0; i < H; i++) {
        cin >> S[i];
        for (ll j = 0; j < W; j++){
            assert(S[i][j] == '.' || S[i][j] == '#');
        }
    }
    for (ll i = 0; i < W; i++){
        assert(S[0][i] == '.');
        assert(S[H - 1][i] == '.');
    }
    lazy_segtree<ll, op, e, ll, mapping, composition, id> seg1(W);
    lazy_segtree<ll, op, e, ll, mapping, composition, id> seg2(W);
    for (ll i = 0; i < W; i++) {
        seg1.set(i, 0);
    }
    for (ll i = H - 2; i >= 0; i--) {
        vector<ll> has_wall(0);
        has_wall.push_back(-1);
        for (ll j = 0; j < W; j++) {
            if (S[i][j] == '#') {
                has_wall.push_back(j);
            }
        }
        has_wall.push_back(W);
        for (ll j = 0; j < W; j++) {
            ll left;
            ll right;
            if (S[i + 1][j] == '.' && S[i][j] == '.') {
                auto itr = lower_bound(all(has_wall), j);
                right = *itr - 1;
                itr--;
                left = *itr + 1;
                left = max(left, j - seg1.get(j));
                right = min(right, j + seg1.get(j));
                // debug_out(i, j, left, right, seg1.get(j));
                seg2.apply(left, right + 1, seg1.get(j));
            }
        }
        /*for (ll j = 0; j < W; j++) {
            cout << seg2.get(j) << " ";
        }
        cout << endl;*/
        for (ll j = 0; j < W - 1; j++) {
            ll val = seg2.get(j);
            ll val2 = seg2.get(j + 1);
            if (val2 > val && S[i][j] == '.' && S[i][j + 1] == '.') {
                seg2.set(j + 1, val + 1);
            }
        }
        for (ll j = W - 1; j > 0; j--) {
            ll val = seg2.get(j);
            ll val2 = seg2.get(j - 1);
            if (val2 > val && S[i][j] == '.' && S[i][j - 1] == '.') {
                seg2.set(j - 1, val + 1);
            }
        }
        for (ll j = 0; j < W; j++) {
            if (S[i][j] == '#') {
                seg1.set(j, INF);
            } else {
                seg1.set(j, seg2.get(j));
            }
        }
        for (ll j = 0; j < W; j++) {
            seg2.set(j, INF);
        }
        /*for (ll j = 0; j < W; j++) {
            cout << seg1.get(j) << " ";
        }
        cout << endl;*/
    }
    for (ll j = 0; j < W; j++) {
        cout << seg1.get(j) << endl;
    }
}
0