oj.uz

Submission #228974

# Submission time Handle Problem Language Result Execution time Memory
228974 2020-05-03T08:11:54 Z VEGAnn Maja (COCI18_maja) C++14
11 / 110
 29 ms 22528 KB 
#include <bits/stdc++.h>
#define PB push_back
using namespace std;
typedef long long ll;
const ll N = 110;
const ll PW = 22;
ll c[N][N], a, b, n, m, k;
ll ans[4 * 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;

    for (ll ite = 1; ite <= 2 * (n + m); 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 <= 2 * n * m)
        cout << ans[k][a][b] - 1 << '\n';
    else {
        ll res = 0;

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

            ll cur = ans[i][j][st] - 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);
        }

        cout << res;
    }

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1024 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 5888 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1792 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 22528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 5504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 11904 KB Output isn't correct
2 Halted 0 ms 0 KB -