제출 #228990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228990		VEGAnn	Maja (COCI18_maja)	C++14	88 / 110	69 ms	65540 KiB

maja

#include <bits/stdc++.h>
#define PB push_back
using namespace std;
typedef long long ll;
const int CNST = 2;
const ll N = 110;
const ll PW = 22;
ll c[N][N], a, b, n, m, k;
ll ans[8 * N][N][N];

void MAX(ll &x, ll y){
    x = max(x, y);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m >> a >> b >> k;
    a--; b--;

    for (ll i = 0; i < n; i++)
        for (ll j = 0; j < m; j++)
            cin >> c[i][j];

    ans[0][a][b] = 1;

    int cnst = 4 * (n + m);

    for (ll ite = 1; ite <= cnst; ite++){
//    for (ll ite = 1; ite <= CNST; ite++){
        for (ll i = 0; i < n; i++)
        for (ll j = 0; j < m; j++){
            if (ans[ite - 1][i][j] == 0) continue;

            if (i > 0) MAX(ans[ite][i - 1][j], ans[ite - 1][i][j] + c[i - 1][j]);
            if (j > 0) MAX(ans[ite][i][j - 1], ans[ite - 1][i][j] + c[i][j - 1]);
            if (j + 1 < m) MAX(ans[ite][i][j + 1], ans[ite - 1][i][j] + c[i][j + 1]);
            if (i + 1 < n) MAX(ans[ite][i + 1][j], ans[ite - 1][i][j] + c[i + 1][j]);
        }
    }

    if (k <= cnst)
        cout << ans[k][a][b] - 1 << '\n';
    else {
        ll res = 0;

        for (ll i = 0; i < n; i++)
        for (ll j = 0; j < m; j++)
        for (ll st = 0; st <= cnst; st++){
//        for (ll st = 0; st <= CNST; st++){
            if (ans[st][i][j] == 0) continue;
            if (st + st > k) break;

            ll cur = ans[st][i][j] - 1;

            ll mx = 0;
            if (i > 0) MAX(mx, c[i - 1][j]);
            if (j > 0) MAX(mx, c[i][j - 1]);
            if (j + 1 < m) MAX(mx, c[i][j + 1]);
            if (i + 1 < n) MAX(mx, c[i + 1][j]);

            mx += c[i][j];

            res = max(res, cur * 2 + mx * (k - st * 2) / 2 - c[i][j]);
        }

        cout << res;
    }

    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11