oj.uz

Submission #44728

# Submission time Handle Problem Language Result Execution time Memory
44728 2018-04-05T14:19:10 Z cheater2k Maxcomp (info1cup18_maxcomp) C++17
100 / 100
 222 ms 36112 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
const int N = 1005;
const int dx[] = {0, 0, -1, +1}, dy[] = {-1, +1, 0, 0};

int n, m;
int a[N][N];
long long f1[N][N];
long long f2[N][N];
long long f3[N][N];
long long f4[N][N];
long long res = -INF;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);

	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			cin >> a[i][j];
		}
	}

	for (int i = 0; i <= n + 1; ++i) {
		for (int j = 0; j <= m + 1; ++j) {
			f1[i][j] = f2[i][j] = f3[i][j] = f4[i][j] = -INF;
		}
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			f1[i][j] = max({(long long)-a[i][j] + i + j, f1[i - 1][j], f1[i][j - 1]});
		}
		for (int j = m; j >= 1; --j) {
			f2[i][j] = max({(long long)-a[i][j] + i - j, f2[i - 1][j], f2[i][j + 1]});
		}
	}

	for (int i = n; i >= 1; --i) {
		for (int j = 1; j <= m; ++j) {
			f3[i][j] = max({(long long)-a[i][j] - i + j, f3[i + 1][j], f3[i][j - 1]});
		}
		for (int j = m; j >= 1; --j) {
			f4[i][j] = max({(long long)-a[i][j] - i - j, f4[i + 1][j], f4[i][j + 1]});
		}
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			res = max(res, a[i][j] - 1 - i - j + f1[i][j]);
			res = max(res, a[i][j] - 1 - i + j + f2[i][j]);
			res = max(res, a[i][j] - 1 + i - j + f3[i][j]);
			res = max(res, a[i][j] - 1 + i + j + f4[i][j]);
		}
	}

	cout << res << endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 672 KB Output is correct
4 Correct 2 ms 672 KB Output is correct
5 Correct 2 ms 736 KB Output is correct
6 Correct 2 ms 784 KB Output is correct
7 Correct 2 ms 784 KB Output is correct
8 Correct 2 ms 784 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 672 KB Output is correct
4 Correct 2 ms 672 KB Output is correct
5 Correct 2 ms 736 KB Output is correct
6 Correct 2 ms 784 KB Output is correct
7 Correct 2 ms 784 KB Output is correct
8 Correct 2 ms 784 KB Output is correct
9 Correct 3 ms 1660 KB Output is correct
10 Correct 3 ms 1660 KB Output is correct
11 Correct 3 ms 1660 KB Output is correct
12 Correct 3 ms 1660 KB Output is correct
13 Correct 3 ms 1660 KB Output is correct
14 Correct 3 ms 1660 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 672 KB Output is correct
4 Correct 2 ms 672 KB Output is correct
5 Correct 2 ms 736 KB Output is correct
6 Correct 2 ms 784 KB Output is correct
7 Correct 2 ms 784 KB Output is correct
8 Correct 2 ms 784 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 3 ms 876 KB Output is correct
12 Correct 3 ms 1660 KB Output is correct
13 Correct 3 ms 1660 KB Output is correct
14 Correct 3 ms 1660 KB Output is correct
15 Correct 3 ms 1660 KB Output is correct
16 Correct 3 ms 1660 KB Output is correct
17 Correct 3 ms 1660 KB Output is correct
18 Correct 184 ms 36092 KB Output is correct
19 Correct 185 ms 36100 KB Output is correct
20 Correct 171 ms 36100 KB Output is correct
21 Correct 176 ms 36112 KB Output is correct
22 Correct 222 ms 36112 KB Output is correct
23 Correct 179 ms 36112 KB Output is correct
24 Correct 173 ms 36112 KB Output is correct