Submission #364352

#	Time	Username	Problem	Language	Result	Execution time	Memory
364352		amunduzbaev	Maxcomp (info1cup18_maxcomp)	C++14	15 / 100	3 ms	364 KiB

maxcomp

/** made by amunduzbaev **/

#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define x.fff get<0>(x)
//#define x.sss get<1>(x)
//#define x.ttt get<2>(x)
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int, int> pii; 
typedef pair<ll, ll> pll; 
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 1005; 
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

#define MULTI 0

int n, m, k, ans, res, a[N][N]; //, dis[N][N]; 

void solve(int t_case){
	cin>>n>>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++){
			int cur = a[i][j];
			int x = i, y = j;
			//cout<<"_____________________________\n";
			//cout<<i<<" "<<j<<" "<<cur<<"\n";
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					umax(res, cur - a[i][j] - (abs(x - i) + abs(y - j) +1));
					umax(res, a[i][j] - cur - (abs(x - i) + abs(y - j) +1));
					//cout<<i<<" "<<j<<" "<<a[i][j]<<"\n";
				}
			}
		}
	}
	
	cout<<res<<"\n";
}

signed main(){
	NeedForSpeed
	
	if(!MULTI) {
		solve(1);
	} else {
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	}
	return 0;
}

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