oj.uz

Submission #521325

# Submission time Handle Problem Language Result Execution time Memory
521325 2022-02-01T17:08:47 Z lucri Maxcomp (info1cup18_maxcomp) C++17
15 / 100
 1 ms 204 KB 
#include <iostream>
using namespace std;
long long x[50][50],n,m,a[50][50],ans=-100000000000;
int main()
{
    cin>>n>>m;
    for(long long i=1;i<=n;++i)
        for(long long j=1;j<=m;++j)
        {
            cin>>a[i][j];
            a[i][j]+=i+j;
            x[i][j]=a[i][j];
        }
    for(long long i=n;i>=1;--i)
        for(long long j=m;j>=1;--j)
        {
            if(j<m)
                x[i][j]=min(x[i][j],x[i][j+1]);
            if(i<n)
                x[i][j]=min(x[i][j],x[i+1][j]);
            if(ans<a[i][j]-x[i][j]-1)
                ans=a[i][j]-x[i][j]-1;
        }
    for(long long i=n;i>=1;--i)
        for(long long j=m;j>=1;--j)
        {
            a[i][j]-=2*(i+j);
            x[i][j]=a[i][j];
            if(j<m)
                x[i][j]=max(x[i][j],x[i][j+1]);
            if(i<n)
                x[i][j]=max(x[i][j],x[i+1][j]);
            if(ans<x[i][j]-a[i][j]-1)
                ans=x[i][j]-a[i][j]-1;
        }
    for(long long i=1;i<n/2;++i)
        for(long long j=1;j<=m;++j)
        {
            a[i][j]+=i+j;
            a[n-i+1][j]+=i+j;
            swap(a[i][j],a[n-i+1][j]);
            a[i][j]+=i+j;
            a[n-i+1][j]+=i+j;
            x[i][j]=a[i][j];
            x[n-i+1][j]=a[n-i+1][j];
        }
    if(n%2==0)
    {
        int i=n/2;
        for(long long j=1;j<=m;++j)
        {
            a[i][j]+=i+j;
            a[n-i+1][j]+=i+j;
            swap(a[i][j],a[n-i+1][j]);
            a[i][j]+=i+j;
            a[n-i+1][j]+=i+j;
            x[i][j]=a[i][j];
            x[n-i+1][j]=a[n-i+1][j];
        }
    }
    else
    {
        int i=n/2;
        for(long long j=1;j<=m;++j)
        {
            a[i][j]+=i+j;
            a[i][j]+=i+j;
            x[i][j]=a[i][j];
        }
    }
    for(long long i=n;i>=1;--i)
        for(long long j=m;j>=1;--j)
        {
            if(j<m)
                x[i][j]=min(x[i][j],x[i][j+1]);
            if(i<n)
                x[i][j]=min(x[i][j],x[i+1][j]);
            if(ans<a[i][j]-x[i][j]-1)
                ans=a[i][j]-x[i][j]-1;
        }
    for(long long i=n;i>=1;--i)
        for(long long j=m;j>=1;--j)
        {
            a[i][j]=a[i][j]-2*(i+j);
            x[i][j]=a[i][j];
            if(j<m)
                x[i][j]=max(x[i][j],x[i][j+1]);
            if(i<n)
                x[i][j]=max(x[i][j],x[i+1][j]);
            if(ans<x[i][j]-a[i][j]-1)
                ans=x[i][j]-a[i][j]-1;
        }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -