oj.uz

Submission #45253

# Submission time Handle Problem Language Result Execution time Memory
45253 2018-04-12T08:11:29 Z ikura355 Maxcomp (info1cup18_maxcomp) C++14
60 / 100
 500 ms 17240 KB 
#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++) {
            for(int i=1;i<=n;i++) {
                for(int j=1;j<=m;j++) {
                    ans = max(ans, p[x][y] - p[i][j] - (abs(x-i)+abs(y-j)+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!=x) 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

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.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 556 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 556 KB Output is correct
9 Correct 16 ms 828 KB Output is correct
10 Correct 16 ms 848 KB Output is correct
11 Correct 16 ms 848 KB Output is correct
12 Correct 18 ms 928 KB Output is correct
13 Correct 15 ms 956 KB Output is correct
14 Correct 18 ms 1032 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 556 KB Output is correct
9 Correct 4 ms 576 KB Output is correct
10 Correct 4 ms 576 KB Output is correct
11 Correct 4 ms 576 KB Output is correct
12 Correct 16 ms 828 KB Output is correct
13 Correct 16 ms 848 KB Output is correct
14 Correct 16 ms 848 KB Output is correct
15 Correct 18 ms 928 KB Output is correct
16 Correct 15 ms 956 KB Output is correct
17 Correct 18 ms 1032 KB Output is correct
18 Execution timed out 1080 ms 17240 KB Time limit exceeded
19 Halted 0 ms 0 KB -