oj.uz

답안 #670751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670751 2022-12-10T08:45:21 Z MohammadAghil The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 2710 ms 53188 KB 
      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
 using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
     #define per(i,r,l) for(int i = (r); i >= (l); i--)
       #define rep(i,l,r) for(int i = (l); i < (r); i++)
          #define all(x) begin(x), end(x)
             #define sz(x) (int)(x).size()
                 #define pb push_back
                     #define ss second
                          #define ff first
                                  void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
void IOS(){
     cin.tie(0) -> sync_with_stdio(0);
     #ifndef ONLINE_JUDGE
          #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
     #else
          #define er(args ...) 0
     #endif
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 2e3 + 5, lg = 22, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll,md);return k*k%md*(b&1ll?a:1)%md;}

int n, m;
int a[maxn][maxn], b[maxn][maxn];
pair<int, pp> mx;

ll slv(){
     // er(mx.ff, mx.ss.ff, mx.ss.ss);
     auto get = [&](int x){
          x = mx.ff - x - 1;
          int ptr = n;
          int mxx = 0, mnn = inf;
          rep(j,0,m){
               rep(i,0,ptr) if(a[i][j] <= x){
                    ptr = i;
                    break;
               }
               // er(j, ptr);
               if(j == mx.ss.ss){
                    if(ptr <= mx.ss.ff) return int(inf);
               }
               rep(i,ptr,n){
                    mxx = max(mxx, a[i][j]);
                    mnn = min(mnn, a[i][j]);
               }
               
          }
          return mxx - mnn;
     };
     int lx = -1, rx = mx.ff;
     while(lx + 1 < rx){
          int mid = (lx + rx)>>1;
          // er(mid, get(mid));
          if(mid < get(mid)) lx = mid;
          else rx = mid;
     }
     // er(lx);
     return min(lx+1, get(lx));
}

int main(){ IOS();
     cin >> n >> m;
     rep(i,0,n){
          rep(j,0,m) {
               cin >> a[i][j];
               mx = max(mx, {a[i][j], {i, j}});
          }
     }
     ll ans = slv();  
     // rep(i,0,n){
     //      rep(j,0,m){
     //           b[i][j] = a[n-1-i][m-1-j];
     //      }
     // }
     // rep(i,0,n){
     //      rep(j,0,m){
     //           a[i][j] = b[i][j];
     //      }
     // }
     // mx.ss.ff = n-1-mx.ss.ff, mx.ss.ss = m-1-mx.ss.ss;
     // ans = min(ans, slv());
     rep(i,0,n){
          rep(j,0,m){
               b[i][j] = a[i][m-1-j];
          }
     }
     rep(i,0,n){
          rep(j,0,m){
               a[i][j] = b[i][j];
          }
     }
     mx.ss.ss = m-1-mx.ss.ss;
     ans = min(ans, slv());
     rep(i,0,n){
          rep(j,0,m){
               b[i][j] = a[n-1-i][j];
          }
     }
     rep(i,0,n){
          rep(j,0,m){
               a[i][j] = b[i][j];
          }
     }
     mx.ss.ff = n-1-mx.ss.ff;
     ans = min(ans, slv());
     rep(i,0,n){
          rep(j,0,m){
               b[i][j] = a[i][m-1-j];
          }
     }
     rep(i,0,n){
          rep(j,0,m){
               a[i][j] = b[i][j];
          }
     }
     mx.ss.ss = m-1-mx.ss.ss;
     ans = min(ans, slv());
     cout << ans << '\n';
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 4 ms 2260 KB Output is correct
17 Correct 8 ms 2528 KB Output is correct
18 Correct 7 ms 2516 KB Output is correct
19 Correct 10 ms 2528 KB Output is correct
20 Correct 6 ms 2260 KB Output is correct
21 Correct 8 ms 2648 KB Output is correct
22 Correct 8 ms 2512 KB Output is correct
23 Correct 11 ms 2644 KB Output is correct
24 Correct 7 ms 2276 KB Output is correct
25 Correct 9 ms 2624 KB Output is correct
26 Correct 10 ms 2524 KB Output is correct
27 Correct 8 ms 2644 KB Output is correct
28 Correct 10 ms 2644 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 4 ms 2260 KB Output is correct
17 Correct 8 ms 2528 KB Output is correct
18 Correct 7 ms 2516 KB Output is correct
19 Correct 10 ms 2528 KB Output is correct
20 Correct 6 ms 2260 KB Output is correct
21 Correct 8 ms 2648 KB Output is correct
22 Correct 8 ms 2512 KB Output is correct
23 Correct 11 ms 2644 KB Output is correct
24 Correct 7 ms 2276 KB Output is correct
25 Correct 9 ms 2624 KB Output is correct
26 Correct 10 ms 2524 KB Output is correct
27 Correct 8 ms 2644 KB Output is correct
28 Correct 10 ms 2644 KB Output is correct
29 Correct 1468 ms 37656 KB Output is correct
30 Correct 1307 ms 53188 KB Output is correct
31 Correct 1676 ms 39264 KB Output is correct
32 Correct 1405 ms 39292 KB Output is correct
33 Correct 1257 ms 43400 KB Output is correct
34 Correct 1419 ms 39380 KB Output is correct
35 Correct 2710 ms 37444 KB Output is correct
36 Correct 2176 ms 47760 KB Output is correct
37 Correct 2497 ms 42308 KB Output is correct