oj.uz

답안 #963336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963336 2024-04-14T21:02:58 Z biank Maxcomp (info1cup18_maxcomp) C++14
100 / 100
 96 ms 21024 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) int(x.size())
#define all(x) begin(x),end(x)

const int INF = 2e9;

int solve(vector<vector<int>> &a) {
    int n = sz(a), m = sz(a[0]);
    vector<vector<int>> dp1(n, vector<int>(m));
    vector<vector<int>> dp2(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            dp1[i][j] = -a[i][j] + i + j - 1;
            dp2[i][j] = a[i][j] + i + j - 1;
            if (i != 0) {
                dp1[i][j] = max(dp1[i][j], dp1[i - 1][j]);
                dp2[i][j] = max(dp2[i][j], dp2[i - 1][j]);
            }
            if (j != 0) {
                dp1[i][j] = max(dp1[i][j], dp1[i][j - 1]);
                dp2[i][j] = max(dp2[i][j], dp2[i][j - 1]);
            }
        }
    }
    int ans = -INF;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            ans = max({ans, a[i][j] - i - j + dp1[i][j], -a[i][j] - i - j + dp2[i][j]});
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }
    int ans = solve(a);
    for (int i = 0; i < n; i++) {
        reverse(all(a[i]));
    }
    ans = max(ans, solve(a));
    cout << ans << '\n';
    
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 86 ms 20768 KB Output is correct
19 Correct 88 ms 20816 KB Output is correct
20 Correct 83 ms 19860 KB Output is correct
21 Correct 88 ms 20820 KB Output is correct
22 Correct 96 ms 20824 KB Output is correct
23 Correct 93 ms 20816 KB Output is correct
24 Correct 88 ms 21024 KB Output is correct