제출 #1318987

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1318987		m.zeeshanrashid	Maxcomp (info1cup18_maxcomp)	C++20	60 / 100	1098 ms	63028 KiB

maxcomp

// #ifdef __AVX2__
// #pragma GCC target "avx2"
// #endif
// #pragma GCC optimize "O3"
// #pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int iter=1,itera=1;
void solve(){
	int n,m;
	cin>>n>>m;
	vec<vec<int>>g(n,vec<int>(m));
	for(auto &i:g) for(auto &j:i) cin>>j;
	vec<vec<int>>a;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)
			a.append({g[i][j],i,j});
	}
	sort(all(a));
	int si=n*m,ans=-1e18;
	for(int i=0;i<si;i++){
		for(int j=i;j<si;j++){
			int x=a[j][0]-a[i][0];
			x-=abs(a[j][1]-a[i][1])+abs(a[j][2]-a[i][2])+1;
			ans=max(ans,x);
		}
	}
	cout<<ans<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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