Submission #1319088

#	Time	Username	Problem	Language	Result	Execution time	Memory
1319088		muhammad-mutahir	Maxcomp (info1cup18_maxcomp)	C++20	60 / 100	1095 ms	8248 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n>>m;
    int mat[n+1][m+1] = {};
    for(int i = 1;i<=n;i++){
    	for(int j = 1;j<=m;j++){
    		cin>>mat[i][j];
    	}
    }
    int ans = -inf;
    for(int i = 1;i<=n;i++){
    	for(int j = 1;j<=m;j++){
		    for(int i1 = 1;i1<=n;i1++){
		    	for(int j1 = 1;j1<=m;j1++){
		    		
		    		ans = max(ans,mat[i][j]-mat[i1][j1] -(abs(i-i1)+ abs(j-j1) +1));
		    		
		    	}
		    }    		
    	}
    }
    cout<<ans<<endl;



}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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