Blog entries - Codeforces

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	160
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	Dominater069	154
8	awoo	154
10	luogu_official	151

Hi, I was solving this dp question (Maximal square from leetcode).

Let a be the input array.
The correct recurrence relation goes like:
dp[i][j] = min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + 1

Correct code

#include <bits/stdc++.h>
using namespace std;
#define ll long long
 
#ifdef NAYAK
#include "/mnt/D/dual/c/debug.h"
#else
#define DEBUG(x...);
#endif
#define SPEEDUP ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MOD 1000000007
int a[1001][1001],dp[1001][1001];
int rec(int r,int c){
	if(a[r][c]==0)return 0;
	if(dp[r][c]!=-1)return dp[r][c];
	int ans=1;
	if(r>0 && c>0){
		int len=min(rec(r-1,c-1),min(rec(r-1,c),rec(r,c-1)));
		ans=max(ans,1+len);
	}
	return dp[r][c]=ans;
}
void CLEAN(){
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			scanf("%d",&a[i][j]);
			dp[i][j]=-1;
		}
	}
	int ans=INT_MIN;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)ans=max(ans,rec(i,j));
	}
	printf("%lld\n",ans*1LL*ans );
}
 
int32_t main(){
	
	int T=1;
	scanf("%d",&T);
	while(T--){
		CLEAN();
	}
 
 
	#ifdef NAYAK
	cerr << "-- RUN: " << (float)clock() / CLOCKS_PER_SEC << " s --" << endl;
	#endif
 
	return 0;
}

But i was doing something like:
int val=min(dp[i - 1][j], dp[i][j - 1])
if(a[i-val][j-val]==1)dp[i][j] = val+ 1

This relation is incorrect but i was not able to find a testcase where it is failing.

My code

#include <bits/stdc++.h>
using namespace std;
#define ll long long
 
#ifdef NAYAK
#include "/mnt/D/dual/c/debug.h"
#else
#define DEBUG(x...);
#endif
#define SPEEDUP ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MOD 1000000007
int a[1001][1001],dp[1001][1001];
int rec(int r,int c){
	if(a[r][c]==0)return 0;
	if(dp[r][c]!=-1)return dp[r][c];
	int ans=1;
	if(r>0 && c>0){
		int len=min(rec(r,c-1),rec(r-1,c));
		if(a[r-len-1][c-len-1]==1)ans=max(ans,1+len);
	}
	return dp[r][c]=ans;
}
void CLEAN(){
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			scanf("%d",&a[i][j]);
			dp[i][j]=-1;
		}
	}
	int ans=INT_MIN;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)ans=max(ans,rec(i,j));
	}
	printf("%lld\n",ans*1LL*ans );
}
 
int32_t main(){
	
	int T=1;
	scanf("%d",&T);
	while(T--){
		CLEAN();
	}
 
 
	#ifdef NAYAK
	cerr << "-- RUN: " << (float)clock() / CLOCKS_PER_SEC << " s --" << endl;
	#endif
 
	return 0;
}

Can anyone point out a testcase where it fails.

Full text and comments »

shashwat_nayak's blog