Submission #359962

#	Time	Username	Problem	Language	Result	Execution time	Memory
359962		Poimidorka	Maxcomp (info1cup18_maxcomp)	C++14	0 / 100	1 ms	364 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);
	vector<pair<int, pair<int, int>>> v;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> mat[i][j];
			v.push_back({mat[i][j], {i, j}});
		}
	}
	int ans = 0;
	sort(v.rbegin(), v.rend());
	for (int i = 0; i < v.size(); i++) {
		int x = v[i].y.x;
		int y = v[i].y.y;
		opt[x][y] = -1;
		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;
			opt[x][y] = max(opt[x][y], opt[x2][y2] - 1 + mat[x2][y2] - mat[x][y]);
			opt[x][y] = max(opt[x][y], mat[x2][y2] - mat[x][y] - 2);
			ans = max(ans, opt[x][y]);
		}
	}
	cout << ans;
	return 0;
}

Compilation message (stderr)

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:52:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~

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