oj.uz

Submission #228990

# Submission time Handle Problem Language Result Execution time Memory
228990 2020-05-03T08:35:52 Z VEGAnn Maja (COCI18_maja) C++14
88 / 110
 69 ms 65540 KB 
#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.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11520 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Runtime error 69 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3328 KB Output is correct
2 Correct 46 ms 39416 KB Output is correct
3 Runtime error 69 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 47740 KB Output is correct
2 Correct 59 ms 51192 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 10880 KB Output is correct
2 Correct 26 ms 25856 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4608 KB Output is correct
2 Correct 11 ms 8576 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 25088 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct