oj.uz

Submission #531059

# Submission time Handle Problem Language Result Execution time Memory
531059 2022-02-27T14:33:40 Z browntoad The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 2068 ms 66100 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=2005;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
int a[2][maxn][maxn];
signed main(){
    IOS();
    int h,w; cin>>h>>w;
    int fmx=0, fmn=inf;
    REP(i,h){
        REP(j,w){
            cin>>a[0][i][j];
            fmx=max(fmx, a[0][i][j]);
            fmn=min(fmn, a[0][i][j]);
            a[1][i][w-j-1]=a[0][i][j];
        }
    }
    /*REP(id, 4){
        if (id%2) swap(h, w);
        REP(i,h){
            REP(j,w){
                cout<<a[id][i][j]<<' ';
            }
            cout<<endl;
        }
        if (id%2) swap(h, w);
        cout<<endl;
    }
    */
    int ans=inf;
    FOR(id, 0, 2){
        int l=0, r=fmx-fmn;
        while(l<=r){
            if (l==r){
                ans=min(ans, l);
                break;
            }
            int mid=(l+r)/2;
            bool gg=false;
            int prevd=h;
            REP(i,w){
                int k=-1;
                while(k+1<h&&a[id][k+1][i]<=fmn+mid){
                    k++;
                }
                k=min(k, prevd);
                prevd=k;
                //cout<<k<<endl;
                //cout<<acmx<<' '<<acmn<<endl;
                FOR(j, k+1, h){
                    if (fmx-mid>a[id][j][i]){
                        gg=1;
                        break;
                    }
                }
                if (gg) break;
            }
            if (gg){
                l=mid+1;
            }
            else {
                r=mid;
            }
        }
        l=0; r=fmx-fmn;
        while(l<=r){
            if (l==r){
                ans=min(ans, l);
                break;
            }
            int mid=(l+r)/2;
            bool gg=false;
            int prevd=h;
            REP(i,w){
                int k=-1;
                while(k+1<h&&a[id][k+1][i]>=fmx-mid){
                    k++;
                }
                k=min(k, prevd);
                prevd=k;
                //cout<<k<<endl;
                //cout<<acmx<<' '<<acmn<<endl;
                FOR(j, k+1, h){
                    if (mid+fmn<a[id][j][i]){
                        gg=1;
                        break;
                    }
                }
                if (gg) break;
            }
            if (gg){
                l=mid+1;
            }
            else {
                r=mid;
            }
        }
    }
    cout<<ans<<endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 2508 KB Output is correct
17 Correct 5 ms 2764 KB Output is correct
18 Correct 5 ms 2764 KB Output is correct
19 Correct 7 ms 2764 KB Output is correct
20 Correct 5 ms 2420 KB Output is correct
21 Correct 7 ms 2820 KB Output is correct
22 Correct 6 ms 2880 KB Output is correct
23 Correct 6 ms 2816 KB Output is correct
24 Correct 6 ms 2560 KB Output is correct
25 Correct 8 ms 2892 KB Output is correct
26 Correct 7 ms 2872 KB Output is correct
27 Correct 7 ms 2892 KB Output is correct
28 Correct 7 ms 2820 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 2508 KB Output is correct
17 Correct 5 ms 2764 KB Output is correct
18 Correct 5 ms 2764 KB Output is correct
19 Correct 7 ms 2764 KB Output is correct
20 Correct 5 ms 2420 KB Output is correct
21 Correct 7 ms 2820 KB Output is correct
22 Correct 6 ms 2880 KB Output is correct
23 Correct 6 ms 2816 KB Output is correct
24 Correct 6 ms 2560 KB Output is correct
25 Correct 8 ms 2892 KB Output is correct
26 Correct 7 ms 2872 KB Output is correct
27 Correct 7 ms 2892 KB Output is correct
28 Correct 7 ms 2820 KB Output is correct
29 Correct 535 ms 61452 KB Output is correct
30 Correct 540 ms 64620 KB Output is correct
31 Correct 636 ms 64452 KB Output is correct
32 Correct 507 ms 64496 KB Output is correct
33 Correct 457 ms 56812 KB Output is correct
34 Correct 617 ms 64556 KB Output is correct
35 Correct 2068 ms 66024 KB Output is correct
36 Correct 1550 ms 64684 KB Output is correct
37 Correct 1919 ms 66100 KB Output is correct