Submission #1166570

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166570		steveonalex	Maxcomp (info1cup18_maxcomp)	C++20	100 / 100	76 ms	12104 KiB

maxcomp

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

//mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1005, INF = 1e9 + 69;
int grid[N][N];
int pref[N][N];
int ans = -1;

void calc(int n, int m){
    for(int i = 0; i <= n; ++i) for(int j = 0; j <= m; ++j) pref[i][j] = -INF;
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j){
        pref[i][j] = grid[i][j] + i + j;
        maximize(pref[i][j], max(pref[i-1][j], pref[i][j-1]));

        maximize(ans, pref[i][j] - grid[i][j] - i - j - 1);
    }
}

void rotate_board(int &n, int &m){
    int tmp[m+1][n+1];
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j){
        tmp[m - j + 1][i] = grid[i][j];
    }
    swap(n, m);
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) grid[i][j] = tmp[i][j];
}

int main(void){
    ios::sync_with_stdio(0); cout.tie(0); cin.tie(0);

    int n, m; cin >> n >> m;
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) cin >> grid[i][j];

    for(int it = 0; it < 4; ++it){
        calc(n, m);
        rotate_board(n, m);
    }
    cout << ans << "\n";

    return 0;
}

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