Submission #18434713

---

Source Code Expand

/*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
using namespace std;
const int N=200;
int n,m,dp[N][N][N][11];
char a[N][N];
inline int read()
{
	int f=1,x=0;char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
	return x*f;
}
inline bool check(int i,int l,int r)
{
	for (int j=l;j<r;j++) if (a[i][j]!=a[i][r]) return 0;
	return 1;
}
signed main()
{
	n=read();m=read();
	for (int i=1;i<=n;i++) scanf("%s",a[i]+1);
	for (int i=n;i>=1;i--)
	{
		for (int l=1;l<=m;l++)
		{
			for (int r=l;r<=m;r++)
			{
				if (!check(i,l,r)) continue;
				if (a[i][l]==a[i+1][l]) dp[i][l][r][0]=dp[i+1][l][r][0]+1;
				else dp[i][l][r][0]=1;
			}
		}
	}
	if (dp[1][1][m][0]==n)
	{
		printf("0\n");
		return 0;
	}
	for (int p=1;p<=15;p++)
	{
		for (int i=1;i<=n;i++)
		{
			for (int l=1;l<=m;l++)
			{
				for (int r=l;r<=m;r++)
				{
					for (int k=l;k<r;k++)
					{
						int num=min(dp[i][l][k][p-1],dp[i][k+1][r][p-1]);
						dp[i][l][r][p]=max(dp[i][l][r][p],num);
					}
					int j=i+dp[i][l][r][p-1];
					dp[i][l][r][p]=max(dp[i][l][r][p],dp[i][l][r][p-1]+dp[j][l][r][p-1]);
				}
			}
		}
		if (dp[1][1][m][p]==n)
		{
			printf("%d\n",p);
			return 0;
		}
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   27 |  for (int i=1;i<=n;i++) scanf("%s",a[i]+1);
      |                         ~~~~~^~~~~~~~~~~~~

Judge Result