Submission #376544

#TimeUsernameProblemLanguageResultExecution timeMemory
376544smjleoThe Kingdom of JOIOI (JOI17_joioi)C++14
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") using namespace std; #define int long long #define nl '\n' #define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) const int mod = 1000000007, mod2 = 998244353; // change this const int N = 2005; int n, m, arr[N][N], k, mini = INT_MAX, maxi = INT_MIN; bool can() { int llp = 0; // confirm leftmost corner for (int i=0; i<n; i++) { // find first place where element > mini+k int fp = n; for (int j=0; j<m; j++) { if (arr[i][j] > mini + k) { fp = j; break; } } // find last place where element < maxi-k int lp = -1; for (int j=m-1; j>=0; j--) { if (arr[i][j] < maxi - k) { lp = j; break; } } lp = max(llp, lp); if (fp <= llp) return false; } return true; } void flipx() { for (int i=0; i<n; i++) for (int j=0; j<m/2; j++) swap(arr[i][j], arr[i][m-j-1]); } void flipy() { for (int i=0; i<n/2; i++) { for (int j=0; j<m; j++) swap(arr[i][j], arr[n-i-1][j]); } } int verify(int kk) { k = kk; bool res = false; for (bool _ : {0, 0}) { res |= can(); flipx(); res |= can(); flipy(); } return res; } signed main() { io; cin >> n >> m; for (int i=0; i<n; i++) { for (int j=0; j<m; j++) { cin >> arr[i][j]; mini = min(mini, arr[i][j]); maxi = max(maxi, arr[i][j]); } } int l = 0, r = 1e9+5; while (l<r) { int mid = (l+r)/2; if (verify(mid)) r = mid; else l = mid+1; } cout << l << nl; }

Compilation message (stderr)

joioi.cpp: In function 'long long int verify(long long int)':
joioi.cpp:57:15: warning: unused variable '_' [-Wunused-variable]
   57 |     for (bool _ : {0, 0}) {
      |               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...