oj.uz

답안 #410700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410700 2021-05-23T12:09:32 Z nichke Maxcomp (info1cup18_maxcomp) C++14
15 / 100
 3 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

int n, m, ans;
int ar[55][55];

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> ar[i][j];
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			for (int k = 0; k < n; k++) {
				for (int l = 0; l < m; l++) {
					int tmp = ar[i][j] - ar[k][l];
					if (i == k && j == l) {
						tmp--;
					} else if (i == k) {
						tmp -= abs(j - l) + 1;
					} else if (j == l) {
						tmp -= abs(i - k) + 1;
					} else {
						tmp -= abs(i - k) + abs(j - l) + 1;
					}
					ans = max(ans, tmp);
				}
			}
		}
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 3 ms 324 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -