oj.uz

답안 #862887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862887 2023-10-19T08:47:25 Z green_gold_dog The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 4000 ms 198324 KB 
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef int ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

ll get(set<pair<ll, pair<ll, ll>>>& s) {
        if (s.empty()) {
                return 0;
        }
        return s.rbegin()->first - s.begin()->first;
}

ll sol(ll n, ll m, vector<vector<ll>>& arr) {
        set<pair<ll, pair<ll, ll>>> s1;
        ll mi = INF32, ma = 0;
        for (ll i = 0; i < n; i++) {
                for (ll j = 0; j < m; j++) {
                        s1.emplace(arr[i][j], make_pair(i, j));
                }
        }
        vector<ll> col(n, m - 1);
        ll na = get(s1);
        while (!s1.empty()) {
                auto[x, y] = s1.rbegin()->second;
                for (ll j = x; j < n; j++) {
                        if (col[j] < y) {
                                break;
                        }
                        while (col[j] >= y) {
                                s1.erase(make_pair(arr[j][col[j]], make_pair(j, col[j])));
                                assign_max(ma, arr[j][col[j]]);
                                assign_min(mi, arr[j][col[j]]);
                                col[j]--;
                        }
                }
                assign_min(na, max(get(s1), ma - mi));
        }
        return na;
}

void solve() {
        ll n, m;
        cin >> n >> m;
        vector<vector<ll>> arr(n, vector<ll>(m));
        for (ll i = 0; i < n; i++) {
                for (ll j = 0; j < m; j++) {
                        cin >> arr[i][j];
                }
        }
        ll ans = INF32;
        for (ll i = 0; i < 2; i++) {
                reverse(arr.begin(), arr.end());
                for (ll j = 0; j < 2; j++) {
                        for (auto& k : arr) {
                                reverse(k.begin(), k.end());
                        }
                        assign_min(ans, sol(n, m, arr));
                }
        }
        cout << ans << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

joioi.cpp:12:22: warning: overflow in conversion from 'long int' to 'll' {aka 'int'} changes value from '9000000000000000000' to '-494665728' [-Woverflow]
   12 | constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~
joioi.cpp: In function 'int main()':
joioi.cpp:109:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
joioi.cpp:110:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 2 ms 604 KB Output is correct
16 Correct 41 ms 2932 KB Output is correct
17 Correct 61 ms 2904 KB Output is correct
18 Correct 56 ms 3088 KB Output is correct
19 Correct 57 ms 2908 KB Output is correct
20 Correct 57 ms 2812 KB Output is correct
21 Correct 62 ms 2908 KB Output is correct
22 Correct 54 ms 2904 KB Output is correct
23 Correct 60 ms 2928 KB Output is correct
24 Correct 49 ms 2648 KB Output is correct
25 Correct 59 ms 3160 KB Output is correct
26 Correct 61 ms 2908 KB Output is correct
27 Correct 61 ms 2904 KB Output is correct
28 Correct 59 ms 2980 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 2 ms 604 KB Output is correct
16 Correct 41 ms 2932 KB Output is correct
17 Correct 61 ms 2904 KB Output is correct
18 Correct 56 ms 3088 KB Output is correct
19 Correct 57 ms 2908 KB Output is correct
20 Correct 57 ms 2812 KB Output is correct
21 Correct 62 ms 2908 KB Output is correct
22 Correct 54 ms 2904 KB Output is correct
23 Correct 60 ms 2928 KB Output is correct
24 Correct 49 ms 2648 KB Output is correct
25 Correct 59 ms 3160 KB Output is correct
26 Correct 61 ms 2908 KB Output is correct
27 Correct 61 ms 2904 KB Output is correct
28 Correct 59 ms 2980 KB Output is correct
29 Execution timed out 4029 ms 198324 KB Time limit exceeded
30 Halted 0 ms 0 KB -