oj.uz

Submission #45423

# Submission time Handle Problem Language Result Execution time Memory
45423 2018-04-13T09:30:18 Z choikiwon Maxcomp (info1cup18_maxcomp) C++17
0 / 100
 2 ms 640 KB 
#include<bits/stdc++.h>
using namespace std;

int N, M;
int A[1010][1010];
int mn1[1010], mn2[1010];

int main() {
    scanf("%d %d", &N, &M);

    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            scanf("%d", &A[i][j]);
        }
    }

    int ans = -2e9;

    for(int i = 0; i < M; i++) {
        mn1[i] = 2e9;
        mn2[i] = 2e9;
    }

    for(int i = N - 1; i >= 0; i--) {
        int tmn1 = 2e9;
        int tmn2 = 2e9;
        for(int j = 0; j < M; j++) {
            ans = max(ans, A[i][j] + i - j - tmn1 - 1);
            mn1[j] = min(mn1[j], A[i][j] + i - j);
            tmn1 = min(tmn1, mn1[j]);
        }
        for(int j = M - 1; j >= 0; j--) {
            ans = max(ans, A[i][j] + i + j - tmn2);
            mn2[j] = min(mn2[j], A[i][j] + i + j);
            tmn2 = min(tmn2, mn2[j]);
        }
    }

    for(int i = 0; i < M; i++) {
        mn1[i] = 2e9;
        mn2[i] = 2e9;
    }

    for(int i = 0; i < N; i++) {
        int tmn1 = 2e9;
        int tmn2 = 2e9;
        for(int j = M - 1; j >= 0; j--) {
            ans = max(ans, A[i][j] - (i - j) - tmn1 - 1);
            mn1[j] = min(mn1[j], A[i][j] - (i - j));
            tmn1 = min(tmn1, mn1[j]);
        }
        for(int j = 0; j < M; j++) {
            ans = max(ans, A[i][j] - (i + j) - tmn2 - 1);
            mn2[j] = min(mn2[j], A[i][j] - (i + j));
            tmn2 = min(tmn2, mn2[j]);
        }
    }

    printf("%d", ans);
}

Compilation message

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:9: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:13:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &A[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 452 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Incorrect 2 ms 640 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 452 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Incorrect 2 ms 640 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 452 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Incorrect 2 ms 640 KB Output isn't correct
8 Halted 0 ms 0 KB -