oj.uz

답안 #862884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862884 2023-10-19T08:42:55 Z green_gold_dog The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 4000 ms 235668 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 long long 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, s2;
        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])));
                                s2.insert(make_pair(arr[j][col[j]], make_pair(j, col[j])));
                                col[j]--;
                        }
                }
                assign_min(na, max(get(s1), get(s2)));
        }
        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: In function 'int main()':
joioi.cpp:107:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
joioi.cpp:108:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 69 ms 3128 KB Output is correct
17 Correct 97 ms 3420 KB Output is correct
18 Correct 93 ms 3420 KB Output is correct
19 Correct 105 ms 3544 KB Output is correct
20 Correct 90 ms 3420 KB Output is correct
21 Correct 100 ms 3676 KB Output is correct
22 Correct 96 ms 3416 KB Output is correct
23 Correct 93 ms 3672 KB Output is correct
24 Correct 88 ms 3368 KB Output is correct
25 Correct 98 ms 3420 KB Output is correct
26 Correct 105 ms 3528 KB Output is correct
27 Correct 98 ms 3676 KB Output is correct
28 Correct 109 ms 3676 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 69 ms 3128 KB Output is correct
17 Correct 97 ms 3420 KB Output is correct
18 Correct 93 ms 3420 KB Output is correct
19 Correct 105 ms 3544 KB Output is correct
20 Correct 90 ms 3420 KB Output is correct
21 Correct 100 ms 3676 KB Output is correct
22 Correct 96 ms 3416 KB Output is correct
23 Correct 93 ms 3672 KB Output is correct
24 Correct 88 ms 3368 KB Output is correct
25 Correct 98 ms 3420 KB Output is correct
26 Correct 105 ms 3528 KB Output is correct
27 Correct 98 ms 3676 KB Output is correct
28 Correct 109 ms 3676 KB Output is correct
29 Execution timed out 4025 ms 235668 KB Time limit exceeded
30 Halted 0 ms 0 KB -