oj.uz

답안 #1107945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107945 2024-11-02T12:35:30 Z HasanV11010238 Maxcomp (info1cup18_maxcomp) C++17
15 / 100
 1 ms 608 KB 
#include <bits/stdc++.h>
#define ll long long
#define INF 10000000000
using namespace std;
int n, m;
ll ans = 0;
vector<vector<ll>> v;
void f(){
    vector<vector<ll>> mi(n + 1, vector<ll>(m + 1, INF));
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            mi[i][j] = min(mi[i][j - 1] + 1, v[i][j]);
        }
    }
    vector<vector<ll>> dp(n + 1, vector<ll>(m + 1, INF));
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            dp[i][j] = min(dp[i - 1][j] + 1, mi[i][j]);
            ans = max(ans, abs(v[i][j] - dp[i][j]) - 1);
        }
    }
}
void swv(){
    for(int i = 1; i <= n / 2; i++){
        swap(v[i], v[n - i + 1]);
    }
}
void swh(){
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m / 2; j++){
            swap(v[i][j], v[i][m - j + 1]);
        }
    }
}
int main(){
    cin>>n>>m;
    v.assign(n + 1, vector<ll>(m + 1, 0));
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            cin>>v[i][j];
        }
    }
    f();
    swh();
    f();
    swv();
    f();
    swh();
    f();
    cout<<ans;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 608 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 608 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 608 KB Output isn't correct
4 Halted 0 ms 0 KB -