oj.uz

Submission #483469

# Submission time Handle Problem Language Result Execution time Memory
483469 2021-10-29T17:58:53 Z ak2006 Maxcomp (info1cup18_maxcomp) C++14
100 / 100
 124 ms 17228 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
    fast;
}
int main()
{
    setIO();
    int n,m;
    cin>>n>>m;
    vvi a(n + 1,vi(m + 1)),dp(n + 1,vi(m + 1));
    for (int i = 1;i<=n;i++)for (int j = 1;j<=m;j++)cin>>a[i][j];
    for (int i = 1;i<=n;i++){
        for (int j = 1;j<=m;j++){
            dp[i][j] = a[i][j] - 1;
            dp[i][j] = max(dp[i][j],dp[i - 1][j] - 1);
            dp[i][j] = max(dp[i][j],dp[i][j - 1] - 1);
        }
    }
    for (int i = n;i>=1;i--){
        for (int j = m;j>=1;j--){
            if (i + 1 <= n)dp[i][j] = max(dp[i][j],
                dp[i + 1][j] - 1);
            if (j + 1 <= m)dp[i][j] = max(dp[i][j],
                dp[i][j + 1] - 1);
        }
    }
    int ans = dp[1][1] - a[1][1];
    for (int i = 1;i<=n;i++)
        for (int j = 1;j<=m;j++)
            ans = max(ans,dp[i][j] - a[i][j]);
    cout<<ans;
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 96 ms 16660 KB Output is correct
19 Correct 105 ms 16660 KB Output is correct
20 Correct 91 ms 16028 KB Output is correct
21 Correct 124 ms 16656 KB Output is correct
22 Correct 97 ms 16708 KB Output is correct
23 Correct 99 ms 16660 KB Output is correct
24 Correct 100 ms 17228 KB Output is correct