oj.uz

답안 #364809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364809 2021-02-10T07:16:20 Z tengiz05 Maxcomp (info1cup18_maxcomp) C++17
60 / 100
 500 ms 16748 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 1005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int n, m, k;
int a[N][N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			cin >> a[i][j];
		}
	}
	int ans = -1e12;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			for(int I=1;I<=n;I++){
				for(int J=1;J<=m;J++){
					int dist = (abs(I-i))+(abs(J-j)+1);
					chmax(ans, max(a[i][j], a[I][J]) - min(a[i][j], a[I][J]) - dist);
				}
			}
		}
	}
	cout << ans << '\n';
	return;
}

signed main(){
	FASTIO;
//~ #define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 364 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 3 ms 364 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 25 ms 620 KB Output is correct
10 Correct 24 ms 524 KB Output is correct
11 Correct 20 ms 620 KB Output is correct
12 Correct 20 ms 620 KB Output is correct
13 Correct 21 ms 620 KB Output is correct
14 Correct 25 ms 640 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 25 ms 620 KB Output is correct
13 Correct 24 ms 524 KB Output is correct
14 Correct 20 ms 620 KB Output is correct
15 Correct 20 ms 620 KB Output is correct
16 Correct 21 ms 620 KB Output is correct
17 Correct 25 ms 640 KB Output is correct
18 Execution timed out 1069 ms 16748 KB Time limit exceeded
19 Halted 0 ms 0 KB -