Submission #160749

#	Time	Username	Problem	Language	Result	Execution time	Memory
160749		shashwatchandra	Maxcomp (info1cup18_maxcomp)	C++17	100 / 100	187 ms	32572 KiB

maxcomp

/*input
2 3
2 4 3
5 7 5
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 1e3+1;
int a[N][N];
int b[N][N];
int n,m;
int dp[N][N];

int getans(){
	REP(i,N){
		REP(j,N){
			dp[i][j] = -INF;
		}
	}
	int ans = 0;
	RE(i,n){
		RE(j,m){
			dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
			dp[i][j] = max(dp[i][j],-a[i][j]+i+j);
			ans = max(ans,dp[i][j]-i-j+a[i][j]);
		}
	}
	return ans;
}

void solve(){
  	cin >> n >> m;
  	RE(i,n){
  		RE(j,m)cin >> a[i][j];
  	}
  	int ovr = getans();
  	RE(i,n){
  		RE(j,m)a[i][j] *= -1;
  	}
  	ovr = max(ovr,getans());
  	RE(i,n){
  		RE(j,m){
  			b[i][j] = a[i][m-j+1];
  		}
  	}
  	RE(i,n){
  		RE(j,m){
  			a[i][j] = b[i][j];
  		}
  	}
  	ovr = max(ovr,getans());
  	RE(i,n){
  		RE(j,m)a[i][j] *= -1;
  	}
  	ovr = max(ovr,getans());
  	cout << ovr-1;
  	/*int ans = 0;
  	RE(i,n){
  		RE(j,m){
  			RE(i1,n){
  				RE(j1,m){
  					ans = max(ans,abs(a[i1][j1]-a[i][j])-abs(i1-i)-abs(j1-j));
  					//if(abs(a[i1][j1]-a[i][j])-abs(i1-i)-abs(j1-j) == 3){
  					//	cout << i << " " << j << " " << i1 << " " << j1 << endl;
  					//}
  				}
  			}
  		}
  	}
  	cout << ans-1;*/
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

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