oj.uz

Submission #45528

# Submission time Handle Problem Language Result Execution time Memory
45528 2018-04-15T00:24:12 Z IvanC Maxcomp (info1cup18_maxcomp) C++17
0 / 100
 2 ms 624 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 10;
const int INF = 1e9 + 1e4;
int N,M,matriz[MAXN][MAXN],linear[MAXN],melhor;
int main(){
	scanf("%d %d",&N,&M);
	melhor = 0;
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<=M;j++){
			scanf("%d",&matriz[i][j]);
		}
	}
	for(int i = 1;i<=N;i++){
		linear[i] = INF;
	}
	for(int j = 1;j<=M;j++){
		int menor = INF;
		for(int i = 1;i<=N;i++){
			linear[i] = min(linear[i] + 1, matriz[i][j] );
			menor = min(menor+1, linear[i] );
			melhor = max(melhor, matriz[i][j] - menor );
		}
	}
	printf("%d\n",melhor - 1);
	return 0;
}

Compilation message

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&N,&M);
  ~~~~~^~~~~~~~~~~~~~~
maxcomp.cpp:11:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&matriz[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 496 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 572 KB Output is correct
6 Incorrect 2 ms 624 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 624 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 496 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 572 KB Output is correct
6 Incorrect 2 ms 624 KB Output isn't correct
7 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 496 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 572 KB Output is correct
6 Incorrect 2 ms 624 KB Output isn't correct
7 Halted 0 ms 0 KB -