結果

問題 No.2456 Stamp Art
ユーザー au7777au7777
提出日時 2023-09-14 14:49:24
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 403 ms / 5,000 ms
コード長 4,402 bytes
コンパイル時間 4,503 ms
コンパイル使用メモリ 245,164 KB
実行使用メモリ 35,456 KB
最終ジャッジ日時 2024-07-01 22:07:44
合計ジャッジ時間 11,800 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
// const double PI = 3.1415926535897932;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
if (y == 0) return x;
else if (y > x) {
return gcd (y, x);
}
else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
//
ll m = 0;
ll M = 3000000001;
while (M - m > 1) {
ll now = (M + m) / 2;
if (now * now <= x) {
m = now;
}
else {
M = now;
}
}
return m;
}
ll keta(ll num, ll arity) {
ll ret = 0;
while (num) {
num /= arity;
ret++;
}
return ret;
}
ll ceil(ll n, ll m) {
// n > 0, m > 0
ll ret = n / m;
if (n % m) ret++;
return ret;
}
ll pow_ll(ll x, ll n) {
if (n == 0) return 1;
if (n % 2) {
return pow_ll(x, n - 1) * x;
}
else {
ll tmp = pow_ll(x, n / 2);
return tmp * tmp;
}
}
vector<ll> compress(vector<ll>& v) {
// [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0]
vector<ll> u = v;
sort(u.begin(), u.end());
u.erase(unique(u.begin(),u.end()),u.end());
map<ll, ll> mp;
for (int i = 0; i < u.size(); i++) {
mp[u[i]] = i;
}
for (int i = 0; i < v.size(); i++) {
v[i] = mp[v[i]];
}
return v;
}
vector<ll> Eratosthenes( const ll N )
{
vector<bool> is_prime( N + 1 );
for( ll i = 0; i <= N; i++ )
{
is_prime[ i ] = true;
}
vector<ll> P;
for( ll i = 2; i <= N; i++ )
{
if( is_prime[ i ] )
{
for( ll j = 2 * i; j <= N; j += i )
{
is_prime[ j ] = false;
}
P.emplace_back( i );
}
}
return P;
}
bool ok(int k, int h, int w, vector<vector<bool>>& black, vector<vector<int>>& cum) {
vector<vector<int>> imos(h + 2, vector<int>(w + 2, 0));
for (int i = 1; i + k - 1 <= h; i++) {
for (int j = 1; j + k - 1 <= w; j++) {
int num = cum[i - 1][j - 1] + cum[i + k - 1][j + k - 1] - cum[i - 1][j + k - 1] - cum[i + k - 1][j - 1];
if (num == k * k) {
imos[i][j]++;
imos[i][j + k]--;
imos[i + k][j]--;
imos[i + k][j + k]++;
}
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
imos[i][j] += imos[i - 1][j];
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
imos[i][j] += imos[i][j - 1];
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
if (black[i][j] && (imos[i][j] == 0)) return false;
if (!black[i][j] && (imos[i][j])) return false;
}
}
return true;
}
int main() {
int h, w;
cin >> h >> w;
vector<vector<bool>> black(h + 1, vector<bool>(w + 1, false));
vector<vector<int>> cum(h + 1, vector<int>(w + 1, 0));
for (int i = 1; i <= h; i++) {
string s;
cin >> s;
for (int j = 1; j <= w; j++) {
if (s[j - 1] == '#') {
black[i][j] = true;
cum[i][j] = cum[i - 1][j] + cum[i][j - 1] - cum[i - 1][j - 1] + 1;
}
else {
cum[i][j] = cum[i - 1][j] + cum[i][j - 1] - cum[i - 1][j - 1];
}
}
}
int no = 2001;
int yes = 1;
while (no - yes > 1) {
int mid = (no + yes) / 2;
if (ok(mid, h, w, black, cum)) yes = mid;
else no = mid;
}
cout << yes << '\n';
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0