oj.uz

Submission #360066

# Submission time Handle Problem Language Result Execution time Memory
360066 2021-01-27T12:34:56 Z Poimidorka Maxcomp (info1cup18_maxcomp) C++17
60 / 100
 500 ms 126160 KB 
#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


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

#define int long long
typedef int ll;


const int maxn = 1e3 + 10;


int mat[maxn][maxn];
pair<int, pair<int, int>> v[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 = -1;
	priority_queue<pair<int, pair<int, int>>> q1, q2, q3, q4;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> mat[i][j];
			v[i * m + j] = {mat[i][j], {i, j}};
		}
	}
	bool f = 0;
	sort(v, v + n * m);
	reverse(v, v + n * m);
	for (int i = 0; i < n * m; i++) {
		int x = v[i].y.x;
		int y = v[i].y.y;
		if (f) {
			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));
		}
		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}});
		f = 1;
	}
	cout << ans;
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 1 ms 1132 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 2 ms 1132 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Execution timed out 502 ms 126160 KB Time limit exceeded
19 Halted 0 ms 0 KB -