結果

問題 No.2657 Falling Block Game
ユーザー akiaa11
提出日時 2024-03-02 17:11:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,159 bytes
コンパイル時間 4,580 ms
コンパイル使用メモリ 256,896 KB
最終ジャッジ日時 2025-02-19 23:56:05
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 17 WA * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}
constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};
template<typename... Args>
void LogOutput(Args&&... args){
    stringstream ss;
    ((ss << args << ' '), ...);
    cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}
int op(int a, int b){return min(a, b);}
int e(){return inf;}
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int h, w;cin>>h>>w;
    vecs s(h);
    rep(i, h) cin>>s[i];
    veci a(w);
    rrep(i, 1, h){
        veci na(w, inf);
        lazy_segtree<int, op, e, int, op, op, e> sg(w);
        veci b(w, inf), c(w, inf);
        veci idx;
        rep(j, w) if(s[i - 1][j] == '#') idx.push_back(j);
        int idx2 = 0;
        rep(j, w){
            if(s[i - 1][j] == '#'){
                idx2++;
                continue;
            }
            int l = idx2 ? max(idx[idx2 - 1] + 1, j - a[j]) : max(0, j - a[j]);
            int r = idx2 + 1 < idx.size() ? min(idx[idx2 + 1], j + a[j] + 1) : min(w, j + a[j] + 1);
            sg.apply(l, r, a[j]);
            int l2 = idx2 ? idx[idx2 - 1] + 1 : 0;
            int r2 = idx2 + 1 < idx.size() ? idx[idx2 + 1] : w;
            if(j - a[j] - 1 >= l2) chmin(c[j - a[j] - 1], a[j] + 1);
            if(j + a[j] + 1 < r2) chmin(b[j + a[j] + 1], a[j] + 1);
        }
        rep(j, 1, w) if(s[i - 1][j] != '#') chmin(b[j], b[j - 1] + 1);
        rrep(j, w - 1) if(s[i - 1][j] != '#') chmin(c[j], c[j + 1] + 1);
        rep(j, w) if(s[i - 1][j] != '#') na[j] = min(b[j], min(c[j], sg.get(j)));
        swap(a, na);
    }
    rep(i, w) cout<<a[i]<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0