oj.uz

Submission #446945

# Submission time Handle Problem Language Result Execution time Memory
446945 2021-07-24T03:06:39 Z zaneyu The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 54848 KB 
/*input
8 6
23 23 10 11 16 21
15 26 19 28 19 20
25 26 28 16 15 11
11 8 19 11 15 24
14 19 15 14 24 11
10 8 11 7 6 14
23 5 19 23 17 17
18 11 21 14 20 16
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=2e3+5;
const ll maxlg=__lg(maxn)+2; 
int mn=INF,mx=0;
int arr[maxn][maxn],tmp[maxn][maxn];
int n,m;
void rot(){
    REP(i,n){
        REP(j,m){
            tmp[m-j-1][i]=arr[i][j];
        }
    }
    swap(n,m);
    REP(i,n) REP(j,m) arr[i][j]=tmp[i][j];
}
bool wk(int mid){
    bool ok=0;
    REP(asd,4){
        bool wk=1;
        if(!ok){
            int pv=m;
            REP(i,n){
                REP(j,pv){
                    if(arr[i][j]>mn+mid){
                        pv=j;
                        break;
                    }
                }
                for(int j=m-1;j>=pv;j--){
                    if(arr[i][j]<mx-mid){
                        wk=0;
                    }
                }
            }
        }
        ok|=wk;
        rot();
    }
    return ok;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n>>m;
    REP(i,n) REP(j,m){
        cin>>arr[i][j];
        MNTO(mn,arr[i][j]);
        MXTO(mx,arr[i][j]);
    }
    /*REP(asd,4){
        REP(i,n){
            REP(j,m) cout<<arr[i][j]<<' ';
            cout<<'\n';
        }
        rot();
        cout<<'\n';
    }*/
    int l=0,r=1e9;
    while(l<r){
        int mid=(l+r)/2;
        if(wk(mid)) r=mid;
        else l=mid+1;
    }
    cout<<l;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 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 2 ms 1868 KB Output is correct
16 Correct 9 ms 2256 KB Output is correct
17 Correct 12 ms 2520 KB Output is correct
18 Correct 12 ms 2508 KB Output is correct
19 Correct 15 ms 2508 KB Output is correct
20 Correct 14 ms 2380 KB Output is correct
21 Correct 17 ms 2636 KB Output is correct
22 Correct 16 ms 2512 KB Output is correct
23 Correct 14 ms 2636 KB Output is correct
24 Correct 12 ms 2508 KB Output is correct
25 Correct 13 ms 2632 KB Output is correct
26 Correct 14 ms 2636 KB Output is correct
27 Correct 14 ms 2640 KB Output is correct
28 Correct 20 ms 2636 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 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 2 ms 1868 KB Output is correct
16 Correct 9 ms 2256 KB Output is correct
17 Correct 12 ms 2520 KB Output is correct
18 Correct 12 ms 2508 KB Output is correct
19 Correct 15 ms 2508 KB Output is correct
20 Correct 14 ms 2380 KB Output is correct
21 Correct 17 ms 2636 KB Output is correct
22 Correct 16 ms 2512 KB Output is correct
23 Correct 14 ms 2636 KB Output is correct
24 Correct 12 ms 2508 KB Output is correct
25 Correct 13 ms 2632 KB Output is correct
26 Correct 14 ms 2636 KB Output is correct
27 Correct 14 ms 2640 KB Output is correct
28 Correct 20 ms 2636 KB Output is correct
29 Correct 3688 ms 53904 KB Output is correct
30 Correct 3590 ms 53224 KB Output is correct
31 Execution timed out 4011 ms 54848 KB Time limit exceeded
32 Halted 0 ms 0 KB -