結果

問題 No.3813 Ashwreath
コンテスト
ユーザー noya2
提出日時 2026-11-21 00:36:08
言語 C++23
(gcc 15.3.0 + boost 1.92.0 + ACL)
コンパイル:
g++-15 -O2 -fplugin=/usr/lib/yukicoder/noavx512-gcc15.so -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
WA  
実行時間 -
コード長 9,131 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,284 ms
コンパイル使用メモリ 357,784 KB
実行使用メモリ 36,336 KB
最終ジャッジ日時 2026-11-21 00:36:19
合計ジャッジ時間 10,020 ms
ジャッジサーバーID
(参考情報)
judge5_0 / judge4_0
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 21 WA * 4
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code

#line 1 "c.cpp"
#include<cassert>
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/* ~ (. _________ . /) */

}

using namespace noya2;


#line 3 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"

#line 5 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"
#include <ranges>

namespace noya2 {

struct grid {
    int h, w;
    grid (int _h = 0, int _w = 0) : h(_h), w(_w) {}
    int idx(int x, int y) const {
        return x * w + y;
    }
    std::pair<int,int> pos(int id) const {
        return {id / w, id % w};
    }
    bool operator()(int x, int y) const {
        return 0 <= x && x < h && 0 <= y && y < w;
    }
    bool operator()(int id) const {
        return operator()(id / w, id % w);
    }
    static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
    auto adj4(int x, int y) const {
        return dxys | std::views::transform([x, y](std::pair<int,int> dxy){
            return std::pair<int,int>(dxy.first + x, dxy.second + y);
        }) | std::views::filter([this](std::pair<int,int> xy){
            return operator()(xy.first, xy.second);
        });
    }
    auto adj4(int id) const {
        return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){
            return idx(xy.first, xy.second);
        });
    }
    int size() const {
        return h * w;
    }
};

} // namespace noya2
#line 5 "c.cpp"

// 0:03~

int dp[2][1<<22];

void solve(){
    int n, m; in(n,m);
    grid gr(n,m);
    // -1 : fire, 0 : empty, 1 : kusa
    vector a(n,vector<int>(m));
    rep(i,n){
        string s; in(s);
        rep(j,m){
            a[i][j] = (s[j] == '#' ? -1 : 0);
        }
    }
    rep(i,n) rep(j,m){
        if (a[i][j] != 0) continue;
        int cnt = 0;
        rep(k,8){
            int x = i + dx[k];
            int y = j + dy[k];
            if (gr(x,y)){
                cnt += int(a[x][y] == -1);
            }
        }
        if (cnt < 2){
            a[i][j] = 1;
        }
    }
    a.insert(a.begin(),vector<int>(m,-1));
    n++;
    // out(a);
    auto clear = [&](int ptr){
        rep(s,1<<(2*m+2)){
            dp[ptr][s] = -iinf;
        }
    };
    auto nxtkusa = [&](int i, int j, int s){
        s >>= 2;
        // U
        {
            int st = s & 3;
            if (st == 1 || st == 2){
                s--;
            }
        }
        // UR
        if (j+1 < m){
            int st = s >> 2 & 3;
            if (st == 1 || st == 2){
                s -= 4;
            }
        }
        // L
        if (j-1 >= 0){
            int st = s >> (2*m-2) & 3;
            if (st == 1 || st == 2){
                s -= 1<<(2*m-2);
            }
        }
        s ^= 3 << (2*m);
        return s;
    };
    auto nxtempty = [&](int i, int j, int s){
        int need = 2;
        // UL
        if ((s & 3) == 3){
            need--;
        }
        s >>= 2;
        // U
        {
            int st = s & 3;
            if (st == 3){
                need--;
            }
        }
        // UR
        if (j+1 < m){
            int st = s >> 2 & 3;
            if (st == 3){
                need--;
            }
        }
        // L
        if (j-1 >= 0){
            int st = s >> (2*m-2) & 3;
            if (st == 3){
                need--;
            }
        }
        chmax(need,0);
        s ^= need << (2*m);
        return s;
    };
    clear(0);
    int src = 0, dst = 1;
    dp[src][0] = 0;
    repp(i,1,n) rep(j,m){
        clear(dst);
        // fire
        if (a[i][j] == -1){
            rep(s,1<<(2*m+2)){
                if (dp[src][s] == -iinf) continue;
                if ((s & 3) == 0 || (s & 3) == 3){
                    chmax(dp[dst][s>>2],dp[src][s]);
                }
            }
        }
        // kusa
        if (a[i][j] == 1){
            rep(s,1<<(2*m+2)){
                if (dp[src][s] == -iinf) continue;
                if ((s & 3) != 2){
                    chmax(dp[dst][nxtkusa(i,j,s)],dp[src][s]);
                }
            }
        }
        if (a[i][j] != 0){
            swap(src,dst);
            continue;
        }
        // empty
        rep(s,1<<(2*m+2)){
            if (dp[src][s] == -iinf) continue;
            // -> kusa
            if ((s & 3) != 2){
                chmax(dp[dst][nxtkusa(i,j,s)],dp[src][s]);
            }
            // -> empty
            if ((s & 3) == 0 || (s & 3) == 3){
                chmax(dp[dst][nxtempty(i,j,s)],dp[src][s]+1);
            }
        }
        swap(src,dst);
    }
    int ans = 0;
    rep(s,1<<(2*m+2)){
        bool ok = true;
        rep(i,m+1){
            int st = s >> (2*i) & 3;
            if (st == 1 || st == 2){
                ok = false;
                break;
            }
        }
        if (ok){
            chmax(ans,dp[src][s]);
        }
    }
    out(ans);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0