Submission #1208164

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208164		M_SH_O	Maxcomp (info1cup18_maxcomp)	C++20	100 / 100	67 ms	16200 KiB

maxcomp

#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll int
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 2000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main() {
    speed;
    srand(time(0));

    ll n, m;
    cin >> n >> m;

    vvll a(n, vll(m)), b(n, vll(m));

    for (int i =0 ; i < n; i ++) {
        for (int j = 0; j < m; j ++) {
            cin >> a[i][j];
        }
    }
    ll k = 1;
    for (int j = 0; j < m; j ++) {
        for (int i =0 ; i < n ;i ++) {
            b[i][j] = k++;
        }
    }


    ll maxl = -INF;
    //vector<multiset<ll>> s(m), s1(m);
    vvll m1(n+1, vll(m, -INF)), m2(n+1, vll(m, -INF));

    for (int i = n-1; i >= 0; i --) {
        for (int j = 0; j < m; j ++) {
            m1[i][j] = max(m1[i+1][j], -a[i][j]-i);
            m2[i][j] = max(m2[i+1][j], a[i][j]-i);
        }
    }

    for (int i = 0; i < n; i++) {
        ll mx = -INF, mn = -INF;
        for (int j = 0, k = m-1; j < m; j ++, k --) {
            mx = max(mx, m2[i][j]-k);
            mn = max(mn, m1[i][j]-k);
            maxl = max(maxl, mx-a[i][j]+i+k);
            maxl = max(maxl, a[i][j]+mn+i+k);
            //if (i == 0 && j == 1) cout << mn << endl;
            //cout << mx-a[i][j]+i+k << ' ' << a[i][j]-(mn+i+k) << ' ' << mn << ' ' << mx << endl;
            /*s[j].erase(s[j].find(-a[i][j]-i));
            s1[j].erase(s1[j].find(a[i][j]-i));*/
        }
        mx = -INF, mn = -INF;
        for (int j = m-1; j >= 0; j --) {
            mx = max(mx, m2[i][j]-j);
            mn = max(mn, m1[i][j]-j);
            maxl = max(maxl, mx-a[i][j]+i+j);
            maxl = max(maxl, a[i][j]+mn+i+j);
        }
    }

    cout << maxl-1 << endl;
}

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