oj.uz

Submission #464855

# Submission time Handle Problem Language Result Execution time Memory
464855 2021-08-14T10:22:03 Z okaragul Maxcomp (info1cup18_maxcomp) C++17
15 / 100
 1 ms 204 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -