oj.uz

Submission #202058

# Submission time Handle Problem Language Result Execution time Memory
202058 2020-02-13T11:17:30 Z blacktulip Maxcomp (info1cup18_maxcomp) C++14
60 / 100
 500 ms 16736 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define int long long
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1005;
const lo mod = 1000000007;

int n,m,b[li],a[li][li],k,flag,t;
int cev=-inf;
string s;
vector<int> v;

main(void){
	scanf("%lld %lld",&n,&m);
	FOR{
		for(int j=1;j<=m;j++){
			scanf("%lld",&a[i][j]);
		}
	}
	FOR{
		for(int j=1;j<=m;j++){
			for(int ii=1;ii<=n;ii++){
				for(int jj=1;jj<=m;jj++){
					cev=max(cev,abs(a[i][j]-a[ii][jj])-abs(jj-j)-abs(ii-i)-1);
				}
			}
		}
	}
	printf("%lld\n",cev);
	return 0;
}

Compilation message

maxcomp.cpp:31:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
maxcomp.cpp: In function 'int main()':
maxcomp.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
maxcomp.cpp:35:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",&a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 380 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 7 ms 380 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 19 ms 504 KB Output is correct
10 Correct 20 ms 504 KB Output is correct
11 Correct 18 ms 504 KB Output is correct
12 Correct 19 ms 504 KB Output is correct
13 Correct 19 ms 504 KB Output is correct
14 Correct 18 ms 632 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 7 ms 380 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 380 KB Output is correct
12 Correct 19 ms 504 KB Output is correct
13 Correct 20 ms 504 KB Output is correct
14 Correct 18 ms 504 KB Output is correct
15 Correct 19 ms 504 KB Output is correct
16 Correct 19 ms 504 KB Output is correct
17 Correct 18 ms 632 KB Output is correct
18 Execution timed out 1068 ms 16736 KB Time limit exceeded
19 Halted 0 ms 0 KB -