oj.uz

Submission #44724

# Submission time Handle Problem Language Result Execution time Memory
44724 2018-04-05T13:58:52 Z cheater2k Maxcomp (info1cup18_maxcomp) C++17
0 / 100
 2 ms 460 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 dp[N][N];
long long res = -INF;
vector < pair<int,int> > vals;

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];
			vals.push_back(make_pair(i, j));
		}
	}

	sort(vals.begin(), vals.end(), [&](pair<int,int> p, pair<int,int> q) {
		return a[p.first][p.second] > a[q.first][q.second];
	});

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			dp[i][j] = -INF;
		}
	}

	for (auto &c : vals) {
		int i = c.first, j = c.second;
		dp[i][j] = -1;
		for (int dir = 0; dir < 4; ++dir) {
			int ni = i + dx[dir], nj = j + dy[dir];
			if (ni < 1 || ni > n || nj < 1 || nj > m) continue;
			dp[i][j] = max(dp[i][j], dp[ni][nj] + a[ni][nj] - 1 - a[i][j]);
		}

		res = max(res, dp[i][j]);
	}

	cout << res << endl;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

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

Subtask #4
0 / 40.0

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