oj.uz

Submission #934808

# Submission time Handle Problem Language Result Execution time Memory
934808 2024-02-28T03:23:28 Z Whisper The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1931 ms 102188 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nCol, nRow;
int a[MAX][MAX], b[MAX][MAX];
void print(){
    FOR(i, 1, nRow) FOR(j, 1, nCol) cout << a[i][j] << " \n"[j == nCol];
}
void rot(){
    //table rotation
    for (int i = 1; i <= nRow; ++i){
        for (int j = 1; j <= nCol; ++j){
            b[j][nRow + 1 - i] = a[i][j];
        }
    }
    swap(nRow, nCol);
    FOR(i, 1, nRow) FOR(j, 1, nCol) a[i][j] = b[i][j];
}
int mn = INF;
void Whisper(){
    cin >> nRow >> nCol;
    FOR(i, 1, nRow) FOR(j, 1, nCol){
        cin >> a[i][j]; minimize(mn, a[i][j]);
    }
    int l = 0, r = 1e9;
    int ans = -1;
//
    auto check = [&](int v){
        for (int dir = 0; dir < 4; ++dir){
            int lst = nCol, mnVal = INF, mxVal = 0;
            for (int i = 1; i <= nRow; ++i){
                for (int j = 1; j <= lst; ++j){
                    if (a[i][j] - mn > v){
                        lst = j - 1; break;
                    }
                }
                for (int j = lst + 1; j <= nCol; ++j){
                    maximize(mxVal, a[i][j]);
                    minimize(mnVal, a[i][j]);
                }
            }
            if(mxVal - mnVal <= v) return 1;
            if (dir < 3) rot();
        }
        return 0;
    };
    while (l <= r){
        int mid = (l + r) >> 1;
        if (check(mid)) r = mid - 1, ans = mid;
        else l = mid + 1;
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 8668 KB Output is correct
16 Correct 4 ms 8676 KB Output is correct
17 Correct 8 ms 8792 KB Output is correct
18 Correct 9 ms 8796 KB Output is correct
19 Correct 8 ms 9012 KB Output is correct
20 Correct 10 ms 8928 KB Output is correct
21 Correct 11 ms 9056 KB Output is correct
22 Correct 12 ms 9048 KB Output is correct
23 Correct 10 ms 9052 KB Output is correct
24 Correct 10 ms 9084 KB Output is correct
25 Correct 9 ms 9048 KB Output is correct
26 Correct 10 ms 9048 KB Output is correct
27 Correct 12 ms 9044 KB Output is correct
28 Correct 13 ms 9052 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 8668 KB Output is correct
16 Correct 4 ms 8676 KB Output is correct
17 Correct 8 ms 8792 KB Output is correct
18 Correct 9 ms 8796 KB Output is correct
19 Correct 8 ms 9012 KB Output is correct
20 Correct 10 ms 8928 KB Output is correct
21 Correct 11 ms 9056 KB Output is correct
22 Correct 12 ms 9048 KB Output is correct
23 Correct 10 ms 9052 KB Output is correct
24 Correct 10 ms 9084 KB Output is correct
25 Correct 9 ms 9048 KB Output is correct
26 Correct 10 ms 9048 KB Output is correct
27 Correct 12 ms 9044 KB Output is correct
28 Correct 13 ms 9052 KB Output is correct
29 Correct 1238 ms 85452 KB Output is correct
30 Correct 1142 ms 84816 KB Output is correct
31 Correct 1081 ms 86548 KB Output is correct
32 Correct 987 ms 86248 KB Output is correct
33 Correct 1079 ms 83168 KB Output is correct
34 Correct 1073 ms 86524 KB Output is correct
35 Correct 1931 ms 102084 KB Output is correct
36 Correct 1450 ms 96596 KB Output is correct
37 Correct 1873 ms 102188 KB Output is correct