Submission #359986

#	Time	Username	Problem	Language	Result	Execution time	Memory
359986		Poimidorka	Maxcomp (info1cup18_maxcomp)	C++14	0 / 100	1081 ms	492 KiB

maxcomp

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <queue>
#include <string>
#include <algorithm>
#include <tuple>
#include <cassert>


using namespace std;


#define x first
#define y second
#define int long long

const int maxn = 1e3 + 10;

int mat[maxn][maxn];
int opt[maxn][maxn];


vector<pair<int, int>> dir = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
int n, m;


bool check(int x, int y) {
	return x >= 0 && y >= 0 && x < n && y < m;
}


signed main() {
#ifdef LC
	assert(freopen("input.txt", "r", stdin));
#endif
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m;
	int ans = -1;
	set<pair<pair<int, int>, pair<int, int>>> q;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> mat[i][j];
			opt[i][j] = -1;
			q.insert({{mat[i][j], -1}, {i, j}});
		}
	}
	while (!q.empty()) {
		auto v = *q.rbegin();
		q.erase(v);
		int x = v.y.x;
		int y = v.y.y;
		for (auto el : dir) {
			int x2 = el.x + x;
			int y2 = el.y + y;
			if (!check(x2, y2) || mat[x2][y2] > mat[x][y])
				continue;
			//cout << x2 << ' ' << y2 << endl;
			q.erase({{mat[x2][y2], opt[x2][y2]}, {x2, y2}});
			opt[x2][y2] = max(opt[x2][y2], opt[x][y] + mat[x][y] - mat[x2][y2] - 1); 
			q.insert({{mat[x2][y2], opt[x2][y2]}, {x2, y2}});
			ans = max(ans, opt[x2][y2]);
		}
	}
	assert(ans != -1);
	cout << ans;
	return 0;
}

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