oj.uz

Submission #1076714

# Submission time Handle Problem Language Result Execution time Memory
1076714 2024-08-26T15:48:16 Z steveonalex The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 364 ms 70484 KB 
// #include "aliens.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2002;
int n, m;
int a[N][N], b[N][N];
int dp[N][N];
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    cin >> n >> m;
    for(int i= 1; i<=n; ++i) 
    for(int j = 1; j<=m; ++j) cin >> a[i][j];

    int mi = 1e9, ma = 0;
    for(int i = 1; i<=n; ++i) for(int j = 1; j<=m; ++j) {
        minimize(mi, a[i][j]);
        maximize(ma, a[i][j]);
    }

    // cout << mi << " " << ma << "\n";

    int ans = 1e9;
    for(int x = 0; x < 4; ++x){
        for(int i = 1; i<=n; ++i) for(int j = 1; j<=m; ++j) b[i][j] = a[i][j];

        if (GETBIT(x, 0)){
            for(int i = 1; i<=n; ++i) reverse(b[i] + 1, b[i] + m + 1);
        }
        if (GETBIT(x, 1)) {
            for(int i = 1; i<=n/2; ++i) {
                for(int j= 1; j<=m; ++j) swap(b[i][j], b[n - i + 1][j]);
            }
        }

        vector<int> dp(m+1);
        for(int i= 1; i<=n; ++i){
            vector<int> cu(m+1);
            int cur = 0;
            for(int j = 1; j<=m; ++j){
                maximize(cur, b[i][j] - mi);
                maximize(cu[j], cur);
            }
            cur = 0;
            for(int j = m; j>=1; --j){
                maximize(cur, ma - b[i][j]);
                maximize(cu[j-1], cur);
            }
            for(int j = 0; j<=m; ++j) maximize(dp[j], cu[j]);
            for(int j = m-1; j>=0; --j) minimize(dp[j], dp[j+1]);
        }
        minimize(ans, dp[0]);
    }

    cout << ans << "\n";
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2360 KB Output is correct
17 Correct 4 ms 2652 KB Output is correct
18 Correct 4 ms 2652 KB Output is correct
19 Correct 4 ms 2652 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 5 ms 2780 KB Output is correct
22 Correct 5 ms 2652 KB Output is correct
23 Correct 4 ms 2788 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 4 ms 2668 KB Output is correct
26 Correct 4 ms 2656 KB Output is correct
27 Correct 6 ms 2652 KB Output is correct
28 Correct 5 ms 2752 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2360 KB Output is correct
17 Correct 4 ms 2652 KB Output is correct
18 Correct 4 ms 2652 KB Output is correct
19 Correct 4 ms 2652 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 5 ms 2780 KB Output is correct
22 Correct 5 ms 2652 KB Output is correct
23 Correct 4 ms 2788 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 4 ms 2668 KB Output is correct
26 Correct 4 ms 2656 KB Output is correct
27 Correct 6 ms 2652 KB Output is correct
28 Correct 5 ms 2752 KB Output is correct
29 Correct 273 ms 52304 KB Output is correct
30 Correct 258 ms 53328 KB Output is correct
31 Correct 302 ms 54868 KB Output is correct
32 Correct 319 ms 54868 KB Output is correct
33 Correct 247 ms 47956 KB Output is correct
34 Correct 282 ms 54868 KB Output is correct
35 Correct 364 ms 70480 KB Output is correct
36 Correct 322 ms 65112 KB Output is correct
37 Correct 339 ms 70484 KB Output is correct