Submission #360071

#	Time	Username	Problem	Language	Result	Execution time	Memory
360071		Poimidorka	Maxcomp (info1cup18_maxcomp)	C++17	60 / 100	442 ms	67140 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


#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,sse4,tune=native")
#pragma GCC optimize("unroll-loops")

typedef long long ll;

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;
}


inline ll gt(int x, int y, int z, int t) {
	return (ll)mat[z][t] - mat[x][y] - abs(z - x) - abs(t - y) - 1;
}


signed main() {
#ifdef LC
	assert(freopen("input.txt", "r", stdin));
#endif
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m;
	ll ans = -1e18;
	priority_queue<pair<int, pair<int, int>>> q1, q2, q3, q4;
	vector<pair<int, pair<int, int>>> v(n * m);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> mat[i][j];
			opt[i][j] = -1;
			v[i * m + j] = {mat[i][j], {i, j}};
		}
	}
	sort(v.rbegin(), v.rend());
	for (auto & el : v) {
		int x = el.y.x;
		int y = el.y.y;
		q1.push({mat[x][y] + x + y, {x, y}});
		q2.push({mat[x][y] + x - y, {x, y}});
		q3.push({mat[x][y] - x + y, {x, y}});
		q4.push({mat[x][y] - x - y, {x, y}});
		ans = max(ans, gt(x, y, q1.top().y.x, q1.top().y.y));
		ans = max(ans, gt(x, y, q2.top().y.x, q2.top().y.y));
		ans = max(ans, gt(x, y, q3.top().y.x, q3.top().y.y));
		ans = max(ans, gt(x, y, q4.top().y.x, q4.top().y.y));
	}
	assert(ans > -2);
	cout << ans;
	return 0;
}

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