oj.uz

Submission #44697

# Submission time Handle Problem Language Result Execution time Memory
44697 2018-04-05T03:02:25 Z admin Maxcomp (info1cup18_maxcomp) C++17
60 / 100
 500 ms 12636 KB 
#include <bits/stdc++.h>

using namespace std;

const int N_ = 1050, M_ = 1050;

int N, M, A[N_][M_];

int ans = -int(1e9);

void go() {
  vector< vector<int> > mn(N+1, vector<int>(M+1, int(1e9)+1));
  vector< vector<int> > mx(N+1, vector<int>(M+1, -1));
  for(int i = 1; i <= N; i++) {
    for(int j = 1; j <= M; j++) {
      int cur_min = min(mn[i][j-1], mn[i-1][j]);
      int cur_max = max(mx[i][j-1], mx[i-1][j]);
      ans = max(ans, max(A[i][j] - cur_min, -A[i][j] + cur_max) - (i + j) - 1);
      mn[i][j] = min(cur_min, A[i][j] - (i + j));
      mx[i][j] = max(cur_max, A[i][j] + (i + j));
    }
  }
}

int main() {
  cin >> N >> M;
  for(int i = 1; i <= N; i++) {
    for(int j = 1; j <= M; j++) {
      cin >> A[i][j];
    }
  }

  // assert(1 <= N * M && N * M <= 20);
  go();
  for(int i = 1; i <= N; i++) {
    reverse(A[i]+1, A[i]+M+1);
  }
  go();

  cout << ans << endl;
  return 0;
}

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 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 512 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 520 KB Output is correct
3 Correct 2 ms 568 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 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 5 ms 700 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 3 ms 752 KB Output is correct
14 Correct 3 ms 844 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 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 520 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 3 ms 696 KB Output is correct
13 Correct 5 ms 700 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 3 ms 752 KB Output is correct
17 Correct 3 ms 844 KB Output is correct
18 Execution timed out 575 ms 12636 KB Time limit exceeded
19 Halted 0 ms 0 KB -