Submission #45254

#	Time	Username	Problem	Language	Result	Execution time	Memory
45254		ikura355	Maxcomp (info1cup18_maxcomp)	C++14	100 / 100	274 ms	67300 KiB

maxcomp

#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e3 + 5;

int n,m;
long long p[maxn][maxn];
long long mx[maxn][maxn];

int main() {
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%lld",&p[i][j]);
    long long ans = -1;
    for(int x=1;x<=n;x++) {
        for(int y=1;y<=m;y++) {
            mx[x][y] = -p[x][y] + x + y;
            if(y!=1) mx[x][y] = max(mx[x][y], mx[x][y-1]);
            if(x!=1) mx[x][y] = max(mx[x][y], mx[x-1][y]);
            ans = max(ans, p[x][y] - x - y + mx[x][y] - 1);
        }
    }
    for(int x=n;x>=1;x--) {
        for(int y=1;y<=m;y++) {
            mx[x][y] = -p[x][y] - x + y;
            if(y!=1) mx[x][y] = max(mx[x][y], mx[x][y-1]);
            if(x!=n) mx[x][y] = max(mx[x][y], mx[x+1][y]);
            ans = max(ans, p[x][y] + x - y + mx[x][y] - 1);
        }
    }
    for(int x=1;x<=n;x++) {
        for(int y=m;y>=1;y--) {
            mx[x][y] = -p[x][y] + x - y;
            if(y!=m) mx[x][y] = max(mx[x][y], mx[x][y+1]);
            if(x!=1) mx[x][y] = max(mx[x][y], mx[x-1][y]);
            ans = max(ans, p[x][y] - x + y + mx[x][y] - 1);
        }
    }
    for(int x=n;x>=1;x--) {
        for(int y=m;y>=1;y--) {
            mx[x][y] = -p[x][y] - x - y;
            if(y!=m) mx[x][y] = max(mx[x][y], mx[x][y+1]);
            if(x!=n) mx[x][y] = max(mx[x][y], mx[x+1][y]);
            ans = max(ans, p[x][y] + x + y + mx[x][y] - 1);
        }
    }
    printf("%lld",ans);
}

Compilation message (stderr)

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
maxcomp.cpp:12:54: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%lld",&p[i][j]);
                                                 ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40