제출 #1143031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143031		tkm_algorithms	Maxcomp (info1cup18_maxcomp)	C++20	0 / 100	1100 ms	213060 KiB

maxcomp

/**
*    In the name of Allah
*    We are nothing and you're everything
*    author: najmuddin
**/
 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
	
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
#define int ll
 
const char nl = '\n';
const int N = 1e8+5;
//const int inf = 1e18;
const int mod = 1e9+7;

void solve() {
	int ans = -1;
	
	int n, m; cin >> n >> m;
	
	vector<vector<int>> a(n, vector<int> (m));
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < m; ++j)cin >> a[i][j];
		
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			for (int x = 0; x < n; ++x) {
				for (int y = 0; y < m; ++y) {
					ans = max(ans, a[i][j]-a[x][y]-abs(x-i)-abs(y-j)-1);
					//if (ans == 3)cout << i << ' ' << j << ' ' << x << ' ' << y << nl;
				}
			}
		}
	}
	cout << ans;
}
 
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
	
	int t = 1;
	cin >> t;
	
	while (t--) {
		solve();
	}
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40