oj.uz

Submission #497103

# Submission time Handle Problem Language Result Execution time Memory
497103 2021-12-22T11:58:18 Z armashka Maxcomp (info1cup18_maxcomp) C++17
100 / 100
 143 ms 44656 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, m, a[1005][1005], pr1[1005][1005], pr2[1005][1005], sf1[1005][1005], sf2[1005][1005];

const void solve(/*Armashka*/) {
	cin >> n >> m;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= n; ++ i) pr1[i][0] = pr2[i][0] = sf1[i][0] = sf2[i][0] = pr1[i][m + 1] = pr2[i][m + 1] = sf1[i][m + 1] = sf2[i][m + 1] = -inf;
	for (int i = 1; i <= m; ++ i) pr1[0][i] = pr2[0][i] = sf1[0][i] = sf2[0][i] = pr1[n + 1][i] = pr2[n + 1][i] = sf1[n + 1][i] = sf2[n + 1][i] = -inf;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			pr1[i][j] = max({pr1[i - 1][j], pr1[i][j - 1], -a[i][j] + i + j});
		}
	}
	for (int i = n; i >= 1; -- i) {
		for (int j = 1; j <= m; ++ j) {
			pr2[i][j] = max({pr2[i + 1][j], pr2[i][j - 1], -a[i][j] - i + j});
		}
	}
	for (int i = 1; i <= n; ++ i) {
		for (int j = m; j >= 1; -- j) {
			sf1[i][j] = max({sf1[i - 1][j], sf1[i][j + 1], -a[i][j] + i - j});
		}
	}
	for (int i = n; i >= 1; -- i) {
		for (int j = m; j >= 1; -- j) {
			sf2[i][j] = max({sf2[i + 1][j], sf2[i][j + 1], -a[i][j] - i - j});
		}
	}
	ll ans = -inf;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) { 
			ll res = pr1[i][j] + a[i][j] - i - j;
			res = max(res, pr2[i][j] + a[i][j] + i - j);
			res = max(res, sf1[i][j] + a[i][j] - i + j);
			res = max(res, sf2[i][j] + a[i][j] + i + j);
			//cout << res << " ";
			ans = max(ans, res);
		} //cout << "\n";
	}
	cout << ans - 1 << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 2 ms 1480 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 2 ms 1480 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 128 ms 42020 KB Output is correct
19 Correct 127 ms 44656 KB Output is correct
20 Correct 121 ms 44624 KB Output is correct
21 Correct 123 ms 44612 KB Output is correct
22 Correct 128 ms 44612 KB Output is correct
23 Correct 143 ms 44552 KB Output is correct
24 Correct 117 ms 42304 KB Output is correct