oj.uz

답안 #870790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
870790 2023-11-09T05:59:16 Z EJIC_B_KEDAX Sightseeing in Kyoto (JOI22_kyoto) C++17
40 / 100
 2000 ms 14956 KB 
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#ifndef LOCAL
    // #pragma GCC optimize("O3")
    // #pragma GCC optimize("Ofast")
    // #pragma GCC optimize("unroll-loops")
    // #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()



mt19937_64 mt(time(0));

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#else
    freopen("input.txt", "r", stdin);
#endif
    init();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

#define int ll

void solve() {
    int h, w;
    cin >> h >> w;
    vector<pair<ll, ll>> a1(h), b1(w), a, b, af, bf, as, bs;
    for (int i = 0; i < h; i++) {
        cin >> a1[i].x;
        a1[i].y = 1;
    }
    for (int i = 0; i < w; i++) {
        cin >> b1[i].x;
        b1[i].y = 1;
    }
    for (int i = 0; i < h; i++) {
        while (a.size() >= 2) {
            auto ff = a.back();
            a.pop_back();
            if (!(a1[i].x <= ff.x && a.back().x <= ff.x)) {
                a.push_back(ff);
                break;
            } else {
                a.back().y += ff.y;
            }
        }
        a.push_back(a1[i]);
    }
    for (int i = 0; i < w; i++) {
        while (b.size() >= 2) {
            auto ff = b.back();
            b.pop_back();
            if (!(b1[i].x <= ff.x && b.back().x <= ff.x)) {
                b.push_back(ff);
                break;
            } else {
                b.back().y += ff.y;
            }
        }
        b.push_back(b1[i]);
    }
    ll ans = 0;
    h = a.size();
    w = b.size();
    af.push_back(a[0]);
    bf.push_back(b[0]);
    for (int i = 1; i < h; i++) {
        if (a[i] > a[i - 1]) {
            as.push_back(a[i]);
        } else {
            af.push_back(a[i]);
        }
    }
    for (int i = 1; i < w; i++) {
        if (b[i] > b[i - 1]) {
            bs.push_back(b[i]);
        } else {
            bf.push_back(b[i]);
        }
    }
    // as.insert(as.begin(), af.back());
    // bs.insert(bs.begin(), bf.back());
    reverse(all(as));
    reverse(all(bs));
    as.push_back(af.back());
    bs.push_back(bf.back());
    for (int i = 0; i < as.size(); i++) {
        as[i].y = as[(i + 1) % as.size()].y;
    }
    for (int i = 0; i < bs.size(); i++) {
        bs[i].y = bs[(i + 1) % bs.size()].y;
    }
    // for (auto i : a) {
    //     cout << i.x << ' ';
    // }
    // cout << '\n';
    // for (auto i : b) {
    //     cout << i.x << ' ';
    // }
    // cout << '\n';
    // for (auto i : af) {
    //     cout << i.x << ' ';
    // }
    // cout << '\n';
    // for (auto i : bf) {
    //     cout << i.x << ' ';
    // }
    // cout << '\n';
    // for (auto i : as) {
    //     cout << i.x << ' ';
    // }
    // cout << '\n';
    // for (auto i : bs) {
    //     cout << i.x << ' ';
    // }
    // cout << '\n';
    // a = af;
    a.clear();
    for (int i = 0; i < af.size(); i++) {
        while (a.size() >= 2) {
            auto ff = a.back();
            a.pop_back();
            if ((ff.x - af[i].x) * a.back().y <= (a.back().x - ff.x) * ff.y) {
                a.push_back(ff);
                break;
            } else {
                a.back().y += ff.y;
            }
        }
        a.push_back(af[i]);
    }
    // b = bf;
    b.clear();
    for (int i = 0; i < bf.size(); i++) {
        while (b.size() >= 2) {
            auto ff = b.back();
            b.pop_back();
            if ((ff.x - bf[i].x) * b.back().y <= (b.back().x - ff.x) * ff.y) {
                b.push_back(ff);
                break;
            } else {
                b.back().y += ff.y;
            }
        }
        b.push_back(bf[i]);
    }
    h = a.size();
    w = b.size();
    ll dp[2][100100];
    // vector<vector<ll>> dp(2, vector<ll>(w + 1, INT64_MAX));
    for (int j = 0; j < w + 1; j++) {
        dp[0][j] = INT64_MAX;
    }
    dp[0][0] = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w + 1; j++) {
            dp[1][j] = INT64_MAX;
        }
        for (int j = 0; j < w; j++) {
            dp[1][j] = min(dp[1][j], dp[0][j] + b[j].x * a[i].y);
            dp[0][j + 1] = min(dp[0][j + 1], dp[0][j] + a[i].x * b[j].y);
        }
        swap(dp[0], dp[1]);
    }
    ans += dp[1][w - 1];
    // cout << dp[0][w - 1] << '\n';
    a.clear();
    for (int i = 0; i < as.size(); i++) {
        while (a.size() >= 2) {
            auto ff = a.back();
            a.pop_back();
            if ((ff.x - as[i].x) * a.back().y <= (a.back().x - ff.x) * ff.y) {
                a.push_back(ff);
                break;
            } else {
                a.back().y += ff.y;
            }
        }
        a.push_back(as[i]);
    }
    // b = bf;
    b.clear();
    for (int i = 0; i < bs.size(); i++) {
        while (b.size() >= 2) {
            auto ff = b.back();
            b.pop_back();
            if ((ff.x - bs[i].x) * b.back().y <= (b.back().x - ff.x) * ff.y) {
                b.push_back(ff);
                break;
            } else {
                b.back().y += ff.y;
            }
        }
        b.push_back(bs[i]);
    }
    h = a.size();
    w = b.size();
    for (int j = 0; j < w + 1; j++) {
        dp[0][j] = INT64_MAX;
    }
    dp[0][0] = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w + 1; j++) {
            dp[1][j] = INT64_MAX;
        }
        for (int j = 0; j < w; j++) {
            dp[1][j] = min(dp[1][j], dp[0][j] + b[j].x * a[i].y);
            dp[0][j + 1] = min(dp[0][j + 1], dp[0][j] + a[i].x * b[j].y);
        }
        swap(dp[0], dp[1]);
    }
    ans += dp[1][w - 1];
    // cout << dp[0][w - 1] << '\n';
    cout << ans << '\n';
}

Compilation message

kyoto.cpp: In function 'void solve()':
kyoto.cpp:108:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for (int i = 0; i < as.size(); i++) {
      |                     ~~^~~~~~~~~~~
kyoto.cpp:111:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     for (int i = 0; i < bs.size(); i++) {
      |                     ~~^~~~~~~~~~~
kyoto.cpp:140:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  140 |     for (int i = 0; i < af.size(); i++) {
      |                     ~~^~~~~~~~~~~
kyoto.cpp:155:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     for (int i = 0; i < bf.size(); i++) {
      |                     ~~^~~~~~~~~~~
kyoto.cpp:189:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |     for (int i = 0; i < as.size(); i++) {
      |                     ~~^~~~~~~~~~~
kyoto.cpp:204:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  204 |     for (int i = 0; i < bs.size(); i++) {
      |                     ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 2 ms 2036 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 2136 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 2076 KB Output is correct
11 Correct 4 ms 1884 KB Output is correct
12 Correct 3 ms 2080 KB Output is correct
13 Correct 73 ms 2392 KB Output is correct
14 Correct 2 ms 1880 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 4 ms 2140 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 2020 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 1 ms 2024 KB Output is correct
27 Correct 2 ms 1956 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 13 ms 1884 KB Output is correct
4 Correct 11 ms 3420 KB Output is correct
5 Correct 13 ms 3420 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 15 ms 5924 KB Output is correct
8 Correct 19 ms 5932 KB Output is correct
9 Correct 18 ms 5724 KB Output is correct
10 Correct 19 ms 5928 KB Output is correct
11 Correct 91 ms 6132 KB Output is correct
12 Correct 16 ms 5708 KB Output is correct
13 Correct 20 ms 5724 KB Output is correct
14 Correct 21 ms 5976 KB Output is correct
15 Correct 13 ms 5724 KB Output is correct
16 Correct 1 ms 2020 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 2 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 1 ms 1884 KB Output is correct
26 Correct 1 ms 2024 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 2 ms 2036 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 2136 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 2076 KB Output is correct
11 Correct 4 ms 1884 KB Output is correct
12 Correct 3 ms 2080 KB Output is correct
13 Correct 73 ms 2392 KB Output is correct
14 Correct 2 ms 1880 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 4 ms 2140 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 2020 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 1 ms 2024 KB Output is correct
27 Correct 2 ms 1956 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct
29 Correct 2 ms 1884 KB Output is correct
30 Correct 1 ms 1880 KB Output is correct
31 Correct 13 ms 1884 KB Output is correct
32 Correct 11 ms 3420 KB Output is correct
33 Correct 13 ms 3420 KB Output is correct
34 Correct 5 ms 2652 KB Output is correct
35 Correct 15 ms 5924 KB Output is correct
36 Correct 19 ms 5932 KB Output is correct
37 Correct 18 ms 5724 KB Output is correct
38 Correct 19 ms 5928 KB Output is correct
39 Correct 91 ms 6132 KB Output is correct
40 Correct 16 ms 5708 KB Output is correct
41 Correct 20 ms 5724 KB Output is correct
42 Correct 21 ms 5976 KB Output is correct
43 Correct 13 ms 5724 KB Output is correct
44 Correct 1 ms 2020 KB Output is correct
45 Correct 1 ms 1884 KB Output is correct
46 Correct 1 ms 1884 KB Output is correct
47 Correct 1 ms 1880 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1884 KB Output is correct
50 Correct 2 ms 1880 KB Output is correct
51 Correct 1 ms 1880 KB Output is correct
52 Correct 2 ms 1884 KB Output is correct
53 Correct 1 ms 1884 KB Output is correct
54 Correct 1 ms 2024 KB Output is correct
55 Correct 11 ms 3828 KB Output is correct
56 Correct 2 ms 1884 KB Output is correct
57 Correct 4 ms 2136 KB Output is correct
58 Correct 7 ms 2648 KB Output is correct
59 Correct 27 ms 6236 KB Output is correct
60 Correct 26 ms 6500 KB Output is correct
61 Correct 24 ms 6224 KB Output is correct
62 Correct 25 ms 6236 KB Output is correct
63 Execution timed out 2025 ms 14956 KB Time limit exceeded
64 Halted 0 ms 0 KB -