oj.uz

답안 #533899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533899 2022-03-07T15:02:22 Z ioi The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 257440 KB 
#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("6in.txt" , "r" , stdin);
#define outF freopen("6.txt" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long
#define int ll
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
const int N =  2e3 + 5 ,  M = N * 64  , MX = 2e4 + 40;
const ll MOD = 1e9 + 7   , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , -1 , 1};


set<int> st ;
vector<int> v ;

int n , m ;

int arr[N][N];
int sz ;

bool check(int from , int to){
    int mx = 0 , mn = 1e9 , en = n;

    for(int c = 0 ; c < m ; c ++){
        for(int r = 0 ; r < n ; r ++){
            if(arr[r][c] < from || arr[r][c] > to)en = min(r , en) ;

            if(r >= en)mx = max(mx , arr[r][c] ) , mn = min(mn , arr[r][c]);
        }

    }


    return mx-mn <= to - from;

}

int arr2[N][N];
int32_t main()
{   //inF;
    //inF;outF;
    fastio;

    cin >> n >> m ;


    for(int i = 0 ; i <  n; i ++){
        for(int j = 0 ; j <m; j ++){
            cin >> arr[i][j];
            arr2[i][j] =  arr[i][j];

            st.insert(arr[i][j]);
        }
    }

    for(auto f : st)v.push_back(f);


    sz = v.size();
    ll mnans = v.back() - v[0];
    for(int all = 0 ; all < 2 ; all ++){


        int  l = 0 , r = v.back() - v[0] , md ;



        while(l <= r){


            md = (l + r) / 2 ;


            if(check(v[0] , v[0] + md) || check(v.back() - md , v.back()))mnans = min(mnans , md) ,  r = md- 1 ;
            else l = md + 1 ;


        }


        for(int c = 0 ; c < m ; c ++){
            for(int r = 0 ; r< n ; r ++){
                arr[r][c] = arr2[r][m - 1 - c];
               // debug(arr[r][c])
            }
        }
    }

    cout << mnans ;

}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 332 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 0 ms 332 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 332 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 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 6 ms 2592 KB Output is correct
17 Correct 20 ms 5312 KB Output is correct
18 Correct 23 ms 5300 KB Output is correct
19 Correct 24 ms 5324 KB Output is correct
20 Correct 19 ms 4748 KB Output is correct
21 Correct 25 ms 5444 KB Output is correct
22 Correct 23 ms 5316 KB Output is correct
23 Correct 27 ms 5456 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 27 ms 5436 KB Output is correct
26 Correct 28 ms 5444 KB Output is correct
27 Correct 29 ms 5380 KB Output is correct
28 Correct 25 ms 5444 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 332 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 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 6 ms 2592 KB Output is correct
17 Correct 20 ms 5312 KB Output is correct
18 Correct 23 ms 5300 KB Output is correct
19 Correct 24 ms 5324 KB Output is correct
20 Correct 19 ms 4748 KB Output is correct
21 Correct 25 ms 5444 KB Output is correct
22 Correct 23 ms 5316 KB Output is correct
23 Correct 27 ms 5456 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 27 ms 5436 KB Output is correct
26 Correct 28 ms 5444 KB Output is correct
27 Correct 29 ms 5380 KB Output is correct
28 Correct 25 ms 5444 KB Output is correct
29 Correct 3175 ms 87832 KB Output is correct
30 Correct 3097 ms 90380 KB Output is correct
31 Correct 3618 ms 91980 KB Output is correct
32 Correct 3474 ms 92036 KB Output is correct
33 Correct 2753 ms 80540 KB Output is correct
34 Correct 3455 ms 92032 KB Output is correct
35 Execution timed out 4059 ms 257440 KB Time limit exceeded
36 Halted 0 ms 0 KB -