Submission #1003749

#TimeUsernameProblemLanguageResultExecution timeMemory
1003749vako_pThe Kingdom of JOIOI (JOI17_joioi)C++14
100 / 100
3001 ms137324 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back const int mxN = 2e3 + 5; ll n,m,a[mxN][mxN],b[mxN][mxN],x,y,p[mxN][mxN]; bool vis[mxN][mxN]; bool turn(ll mid){ swap(x, y); y = n - y + 1; for(int j = 1; j <= m; j++){ for(int i = n; i >= 1; i--){ b[j][n - i + 1] = a[i][j]; } } swap(n, m); for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ a[i][j] = b[i][j]; p[i][j] = max(p[i - 1][j], p[i][j - 1]); p[i][j] = max(p[i][j], a[i][j]); vis[i][j] = false; } } if(p[x][y] - a[x][y] > mid) return false; for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ if(p[i][j] - a[x][y] > mid) break; vis[i][j] = true; } } ll mn = 1e17, mx = 0; for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ if(vis[i][j]) continue; mx = max(mx, a[i][j]); mn = min(mn, a[i][j]); } } return (mx - mn <= mid); } bool ok(ll mid){ return (turn(mid) or turn(mid) or turn(mid) or turn(mid)); } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; ll mn = 1e17; for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ cin >> a[i][j]; if(mn > a[i][j]){ x = i; y = j; mn = a[i][j]; } } } ll l = 0, r = 2e9; while(r > l + 1){ ll mid = l + (r - l) / 2; if(ok(mid)) r = mid; else l = mid; } cout << r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...