提出 #45445826

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define LL long long
#define DB double
#define MOD 1000000007
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) ((-x) & x)
#define MP make_pair
#define VI vector<int>
#define VL vector<LL>
#define VII VI::iterator
#define VLI VL::iterator
#define all(x) x.begin(), x.end()
#define EB emplace_back
#define SI set<int>
#define SII SI::iterator
#define fi first
#define se second
using namespace std;
template<typename T> void chkmn(T &a, const T &b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T &b) { (a < b) && (a = b); }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int inc(const int &a, const int &b) { return (a + b >= MOD) ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return (a - b < 0) ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
int sqr(const int &a) { return 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		k >>= 1, Sqr(x);
	}
	return res;
}
const int N = 190;
int n, m;
char ch[N][N];
int s[N][N][N];
int f[20][N][N][N];
int main()
{
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= n; ++i)
		scanf("%s", ch[i] + 1);
	for(int i = 1; i <= n; ++i)
		for(int l = 1; l <= m; ++l)
		{
			char c = ch[i][l];
			s[i][l][l] = 1;
			for(int r = l + 1; r <= m; ++r)
			{
				if(ch[i][r] != c) break;
				s[i][l][r] = 1;	
			}	
		}
	for(int i = 1; i <= n; ++i)
		for(int l = 1; l <= m; ++l)
			for(int r = l; r <= m; ++r)
			{
				for(int w = 0; w <= 16; ++w)
					f[w][i][l][r] = -1;
				if(s[i][l][r] == 0) continue;
				char c = ch[i][l];
				for(int x = i; x <= n; ++x)
				{
					if(s[x][l][r] == 0 || ch[x][l] != c)
						break;
					f[0][i][l][r] = x;
				}
			}
	
	for(int w = 1; w <= 16; ++w)
		for(int i = 1; i <= n; ++i)
			for(int l = 1; l <= m; ++l)
			{
				int p = l;
				for(int r = l; r <= m; ++r)
				{
					chkmx(f[w][i][l][r], f[w - 1][i][l][r]);
					if(f[w - 1][i][l][r] >= 1 && f[w - 1][i][l][r] < n)
						chkmx(f[w][i][l][r], f[w - 1][f[w - 1][i][l][r] + 1][l][r]);
					auto get = [&](int x) { return min(f[w - 1][i][l][x], f[w - 1][i][x + 1][r]); };
					while(p + 1 < r && get(p + 1) >= get(p)) ++p;
					if(l < r) chkmx(f[w][i][l][r], get(p));
				}
			}
	
	for(int w = 0; w <= 16; ++w)
		if(f[w][1][1][m] == n)
		{
			printf("%d", w);
			return 0;
		}
	return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:47:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   47 |         scanf("%d %d", &n, &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:49:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   49 |                 scanf("%s", ch[i] + 1);
      |                 ~~~~~^~~~~~~~~~~~~~~~~

ジャッジ結果