結果

問題 No.2456 Stamp Art
コンテスト
ユーザー woodywoody
提出日時 2023-09-01 22:15:03
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 801 ms / 5,000 ms
コード長 6,418 bytes
コンパイル時間 3,462 ms
コンパイル使用メモリ 235,108 KB
実行使用メモリ 70,528 KB
最終ジャッジ日時 2024-06-11 17:58:51
合計ジャッジ時間 15,491 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!x) {vi v(3e8);}
#define asserttle(x) if (!x) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

template<typename T>
struct CumulativeSum2D{
    using vvt = vector<vector<T>>;
    vvt s;
    vvt sum;
    int h,w;

    CumulativeSum2D(const vvt& s) : s(s),sum(s){
        h = sz(s); assert(h>0);
        w = sz(s[0]); assert(w>0);
        rep(i,h) rep(j,w){
            if (i) sum[i][j] += sum[i-1][j];
            if (j) sum[i][j] += sum[i][j-1];
            if (i && j) sum[i][j] -= sum[i-1][j-1];
        }
    };
    T get(int il,int ir,int jl,int jr){
        assert(il<=ir); assert(jl<=jr);
        T ret = sum[ir][jr];
        if (il) ret -= sum[il-1][jr];
        if (jl) ret -= sum[ir][jl-1];
        if (il && jl) ret += sum[il-1][jl-1];
        return ret;
    }
};

// CumulativeSum2D 2次元累積和
// CumulativeSum2D<T>(vvt s) : 初期化、sはh*w T型の要素配列
// get(il,ir,jl,jr) : [il,ir] [jl,jr] の sの2次元累積和を返す

void solve(){
    int h,w; cin>>h>>w;

    vs s(h);
    vvi c(h,vi(w));
    rep(i,h) cin>>s[i];
    rep(i,h) rep(j,w) c[i][j] = (s[i][j]=='#');

    CumulativeSum2D<int> a(c);

    auto check = [&](int mid)->bool{
        vvi b(h+1,vi(w+1));
        rep(i,h) rep(j,w){
            if (i+mid>h) continue;
            if (j+mid>w) continue;
            int sum = a.get(i,i+mid-1,j,j+mid-1);
            if (sum == mid*mid){
                b[i][j]++;
                b[i+mid][j]--;
                b[i][j+mid]--;
                b[i+mid][j+mid]++;
            }
        }
        rep(i,h+1) rep1(j,w+1) b[i][j] += b[i][j-1];
        rep(j,w+1) rep1(i,h+1) b[i][j] += b[i-1][j];
        bool ret = true;
        rep(i,h) rep(j,w){
            if ((c[i][j]==0 && b[i][j]!=0) || (c[i][j]!=0 && b[i][j]==0)) ret = false;
        }
        return ret;
    };

    int l = 1,u = min(h,w)+1;

    while(u-l>1){
        int mid = (l+u)/2;
        if (check(mid)) l = mid;
        else u = mid;
    }
    cout << l << endl;

    

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0