oj.uz

답안 #990155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990155 2024-05-29T17:26:35 Z LOLOLO Maja (COCI18_maja) C++14
110 / 110
 98 ms 860 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e2 + 10;
ll mat[N][N], sum[N][N], dp[2][N][N];
 
ll solve() {
    ll k;
    int n, m, a, b;
    cin >> n >> m >> a >> b >> k;
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> mat[i][j];
        }
    }
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            sum[i][j] = max({mat[i - 1][j], mat[i][j - 1], mat[i + 1][j], mat[i][j + 1]}) + mat[i][j];
        }
    }
 
    mem(dp, -63);
 
    dp[0][a][b] = 0;
 
    ll sz = n * m, ans = 0;
 
    for (int id = 1; id <= sz && id * 2 <= k; id++) {
        int t = id % 2;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                dp[t][i][j] = max({dp[1 - t][i - 1][j], dp[1 - t][i][j - 1], dp[1 - t][i + 1][j], dp[1 - t][i][j + 1]}) + mat[i][j];
                ans = max(ans, dp[t][i][j] * (ll)2 + sum[i][j] * ((k - id * 2) / 2) - mat[i][j]);
            }
        }
    }
 
    return ans;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        cout << solve() << '\n';
    }
 
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 712 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 98 ms 860 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 56 ms 820 KB Output is correct
3 Correct 96 ms 852 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 600 KB Output is correct
2 Correct 76 ms 856 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 604 KB Output is correct
2 Correct 6 ms 604 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 724 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 1 ms 600 KB Output is correct