Submission #362808

#	Time	Username	Problem	Language	Result	Execution time	Memory
362808		keta_tsimakuridze	Maxcomp (info1cup18_maxcomp)	C++14	100 / 100	424 ms	20892 KiB

maxcomp

#include<bits/stdc++.h>
#define f first
#define s second
#define pii pair< pair<int,pair<int,int > > ,pair<int,int> > 
using namespace std;
const int N=1e3+5,INF=2e9;
int n,m,dp[N][N][2],k,i,ans,a[N][N];
int a1[]={0,0,-1,1},a2[]={-1,1,0,0};
priority_queue<pii,vector<pii>,greater<pii> > q;
bool ok(int x,int y){
	if(min(x,y)<1 || x>n || y>m ) return 0;
	return 1;
}
 main(){
	cin>>n>>m;
	for(k=1;k<=n;k++){
		for(int i=1;i<=m;i++){
			cin>>a[k][i];
			dp[k][i][0]=0;
		}
	}
	ans=INF;
	for(k=1;k<=2;k++){
		
		for(i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				int cur=dp[i][j][k-1];
				if(k==1) dp[i][j][k]=dp[i][j][k-1]+a[i][j];
				else dp[i][j][k]=dp[i][j][k-1]-a[i][j];
				if(i>1)dp[i][j][k] = min (dp[i][j][k],dp[i-1][j][k]+1);
				if(j>1)dp[i][j][k] = min (dp[i][j][k],dp[i][j-1][k]+1);
			}
		}
		for(i=n;i>=1;i--){
			for(int j=m;j>=1;j--){
				if(i<n)dp[i][j][k] = min (dp[i][j][k],dp[i+1][j][k]+1);
				if(j<m)dp[i][j][k] = min (dp[i][j][k],dp[i][j+1][k]+1);
				if(k==2) ans=min(ans,dp[i][j][k]);
				
			}
		}
	}
	cout<<-ans-1;
}

Compilation message (stderr)

maxcomp.cpp:14:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 |  main(){
      |       ^
maxcomp.cpp: In function 'int main()':
maxcomp.cpp:27:9: warning: unused variable 'cur' [-Wunused-variable]
   27 |     int cur=dp[i][j][k-1];
      |         ^~~
maxcomp.cpp:38:36: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds]
   38 |     if(k==2) ans=min(ans,dp[i][j][k]);
      |                          ~~~~~~~~~~^

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40