Submission #464855

#	Time	Username	Problem	Language	Result	Execution time	Memory
464855		okaragul	Maxcomp (info1cup18_maxcomp)	C++17	15 / 100	1 ms	204 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define endl "\n"
#define all(aa) aa.begin(), aa.end()

int main(){
	int n, m, ans=0;
	cin>>n>>m;
	vector<vector<int>> mat(n, vector<int>(m)), dp(n, vector<int>(m));

	for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) cin>>mat[i][j];

	dp=mat;
	for(int x = n-1; x >= 0; x--) for(int y = m-1; y >= 0; y--)
		ans=max(ans, mat[x][y]-(dp[x][y]=min({dp[x][min(m-1, y+1)]+1, dp[min(n-1, x+1)][y]+1, dp[x][y]+1})));

	dp=mat;
	for(int x = n-1; x >= 0; x--) for(int y = 0; y < m; y++)
		ans=max(ans, mat[x][y]-(dp[x][y]=min({dp[x][max(0, y-1)]+1, dp[min(n-1, x+1)][y]+1, dp[x][y]+1})));

	dp=mat;
	for(int x = 0; x < n; x++) for(int y = m-1; y >= 0; y--)
		ans=max(ans, mat[x][y]-(dp[x][y]=min({dp[x][min(m-1, y+1)]+1, dp[max(0, x-1)][y]+1, dp[x][y]+1})));

	dp=mat;
	for(int x = 0; x < n; x++) for(int y = 0; y < m; y++)
		ans=max(ans, mat[x][y]-(dp[x][y]=min({dp[x][max(0, y-1)]+1, dp[max(0, x-1)][y]+1, dp[x][y]+1})));

	cout<<ans;
}

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