oj.uz

Submission #364814

# Submission time Handle Problem Language Result Execution time Memory
364814 2021-02-10T07:18:25 Z amunduzbaev Maxcomp (info1cup18_maxcomp) C++14
60 / 100
 500 ms 12140 KB 
/** 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 int long long
typedef long long 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 = 2e3+5;
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]; 

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];
		}
	}
	res = -2;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int x = i, y = j;
			int val = a[i][j];
			for(int i=0;i<n;i++) for(int j=0;j<m;j++) umax(res, max(a[i][j], val) - min(val, a[i][j]) - abs(i-x) - abs(j-y) -1);
		}
	}
	
	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
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 408 KB Output is correct
2 Correct 5 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 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 31 ms 620 KB Output is correct
10 Correct 22 ms 492 KB Output is correct
11 Correct 22 ms 492 KB Output is correct
12 Correct 22 ms 492 KB Output is correct
13 Correct 22 ms 492 KB Output is correct
14 Correct 28 ms 492 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 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 5 ms 408 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 4 ms 364 KB Output is correct
12 Correct 31 ms 620 KB Output is correct
13 Correct 22 ms 492 KB Output is correct
14 Correct 22 ms 492 KB Output is correct
15 Correct 22 ms 492 KB Output is correct
16 Correct 22 ms 492 KB Output is correct
17 Correct 28 ms 492 KB Output is correct
18 Execution timed out 1090 ms 12140 KB Time limit exceeded
19 Halted 0 ms 0 KB -