oj.uz

Submission #532218

# Submission time Handle Problem Language Result Execution time Memory
532218 2022-03-02T13:56:26 Z ioi The Kingdom of JOIOI (JOI17_joioi) C++14
0 / 100
 1 ms 204 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 =  1e3 + 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};


int32_t main()
{   //inF;
    //inF;outF;
    fastio;


    int n , m ;
    cin >> n >> m ;

    vector<ll> v(n * m);

    for(auto &it : v)cin >> it ;


    ll arr[n][m];

    for(int i = 0 ; i < n ; i ++)
        for(int j = 0 ; j < m ; j ++)
            arr[i][j] = v[i * m + j];
sort(v.begin() ,v.end());




    int sz = n * m ;
    ll mnans = 1e18 ;
    for(int i = 0 ; i < sz ; i ++){
        for(int j = i ; j < sz ; j ++){

            int en = m - 1 ;
            ll mn = 1e18 , mx = 0 ;


            for(int c = 0 ; c < n ; c ++){
                for(int k = 0 ; k < m ; k ++){
                    if(arr[c][k] > v[j] || arr[c][k] < v[i]){
                        en = k ;
                    }
                    if(k >= en)mn= min(mn , arr[c][k]), mx = max(mx , arr[c][k]);

                }
            }

            mnans = min(mnans , max(mx - mn , v[j] - v[i]));
        }
    }

    cout << mnans ;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -