oj.uz

Submission #245915

# Submission time Handle Problem Language Result Execution time Memory
245915 2020-07-07T18:50:37 Z RealSuperman1 Maxcomp (info1cup18_maxcomp) C++17
60 / 100
 500 ms 12128 KB 
// #pragma comment(linker, "\stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcount,abm,mmx,avx,avx2,tune=native")
//#pragma GCC target("avx,avx2")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("O3")
// #pragma GCC optimization("unroll-loops")


#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>

using namespace std;
using namespace __gnu_pbds;

typedef
tree<
	ll,
	null_type,
	less_equal<ll>,
	rb_tree_tag,
	tree_order_statistics_node_update>
	ordered_set;
	

const int N = 1e3 + 10;
const int mod = 1e9 + 7;
const ll INF = 1e16;
const int lim = 450;


int n, m, a[N][N], more1[N][N], less1[N][N];


int main() {
// 	ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL);
// 	freopen("input.txt", "r", stdin);
// 	freopen("input.in", "r", stdin);
// 	freopen("input.out", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    int ans = -1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            more1[i][j] = a[i][j] + i + j;
            if (i != 1)
                more1[i][j] = max(more1[i][j], more1[i - 1][j]);
            if (j != 1)
                more1[i][j] = max(more1[i][j], more1[i][j - 1]);
                
            less1[i][j] = -a[i][j] + i + j;
            if (i != 1)
                less1[i][j] = max(less1[i][j], less1[i - 1][j]);
            if (j != 1)
                less1[i][j] = max(less1[i][j], less1[i][j - 1]);
            ans = max(ans, a[i][j] + less1[i][j] - i - j - 1);
            // cout << i << " " << j << " " << ans << endl;
            ans = max(ans, -a[i][j] + more1[i][j] - i - j - 1);
            // cout << i << " " << j << " " << ans << endl;
        }
        
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m / 2; j++)
            swap(a[i][j], a[i][m - j + 1]);
    
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            more1[i][j] = a[i][j] + i + j;
            if (i != 1)
                more1[i][j] = max(more1[i][j], more1[i - 1][j]);
            if (j != 1)
                more1[i][j] = max(more1[i][j], more1[i][j - 1]);
                
            less1[i][j] = -a[i][j] + i + j;
            if (i != 1)
                less1[i][j] = max(less1[i][j], less1[i - 1][j]);
            if (j != 1)
                less1[i][j] = max(less1[i][j], less1[i][j - 1]);
            ans = max(ans, a[i][j] + less1[i][j] - i - j - 1);
            // cout << i << " " << j << " " << ans << endl;
            ans = max(ans, -a[i][j] + more1[i][j] - i - j - 1);
            // cout << i << " " << j << " " << ans << endl;
        }
    cout << ans;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
30.0 / 30.0

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

Subtask #4
0 / 40.0

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