提出 #35188417

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define TIME 1e3 * clock() / CLOCKS_PER_SEC
using ll = long long;
using uint = unsigned int;
using lll = __int128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ull = unsigned long long;
inline ll read() {
  ll x = 0, sgn = 0;
  char s = getchar();
  while(!isdigit(s)) sgn |= s == '-', s = getchar();
  while(isdigit(s)) x = x * 10 + s - '0', s = getchar();
  return sgn ? -x : x;
}
inline void print(int x) {
  if(x < 0) return putchar('-'), print(-x);
  if(x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}
bool Mbe;
constexpr int N = 185 + 5;
int n, m, p[N][N], q[N][N], f[N][N][N], ff[N][N][N];
char t[N][N];
int calcp(int a, int b, int c, int d) {
  return p[c][d] - p[a - 1][d] - p[c][b - 1] + p[a - 1][b - 1];
}
int calcq(int a, int b, int c, int d) {
  return q[c][d] - q[a - 1][d] - q[c][b - 1] + q[a - 1][b - 1];
}
bool Med;
int main() {
  fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  cin >> n >> m;
  for(int i = 1; i <= n; i++) cin >> t[i] + 1;
  for(int i = 1; i <= n; i++)
    for(int j = 1; j <= m; j++) {
      p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + (t[i][j] == '#');
      q[i][j] = q[i - 1][j] + q[i][j - 1] - q[i - 1][j - 1] + (t[i][j] == '.');
    }
  for(int k = 1; k <= m; k++)
    for(int l = 1; l <= n; l++) {
      int bound = m;
      for(int r = l; r <= n; r++) {
        while(calcp(l, k, r, bound) && calcq(l, k, r, bound)) bound--;
        f[k][l][r] = bound;
      }
    }
  for(int i = 0; ; i++) {
    if(f[1][1][n] == m) cout << i << "\n", exit(0);
    for(int k = 1; k <= m; k++)
      for(int l = 1; l <= n; l++) {
        int p = l;
        for(int r = l; r <= n; r++) {
          auto val = [&](int p) {return min(f[k][l][p], f[k][p + 1][r]);};
          while(p + 1 < r && val(p) <= val(p + 1)) p++;
          ff[k][l][r] = max(val(p), max(f[k][l][r], f[f[k][l][r] + 1][l][r]));
        }
      }
    swap(f, ff);
  }
  cerr << TIME << " ms\n";
  return 0;
}
/*
2022/9/27
author: Alex_Wei
start coding at 7:05
finish debugging at 7:51
*/

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:43: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   42 |   for(int i = 1; i <= n; i++) cin >> t[i] + 1;
      |                                      ~~~~~^~~

ジャッジ結果