oj.uz

Submission #705804

# Submission time Handle Problem Language Result Execution time Memory
705804 2023-03-05T10:24:00 Z piOOE Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using db = double;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<int> a(n), b(m);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for (int j = 0; j < m; ++j) {
        cin >> b[j];
    }

    set<tuple<db, int, int>, greater<>> st;

    set<int> rows, columns;

    vector<int> last(n + m);

    int iter = 0;

    for (int i = 0; i < n; ++i) {
        rows.insert(rows.end(), i);
    }

    for (int i = 0; i < m; ++i) {
        columns.insert(columns.end(), i);
    }

    for (int i = 0; i < n - 1; ++i) {
        st.emplace(a[i + 1] - a[i], i, 0);
    }

    for (int i = n; i < n + m - 1; ++i) {
        st.emplace(b[i + 1 - n] - b[i - n], i, 0);
    }

    vector<int> when(n + m, -1);

    while (!st.empty()) {
        auto [delta, i, iteration] = *st.begin();
        st.erase(st.begin());

        if (last[i] != iteration) {
            continue;
        }

        when[i] = ++iter;

        if (i >= n) {
            auto it = columns.erase(columns.find(i - n));

            if (it != columns.begin()) {
                int j = *it, p = *prev(it);

                st.emplace(-db(b[j] - b[p]) / (j - p), p + n, last[p + n] = iter);
            }
        } else {
            auto it = rows.erase(rows.find(i));

            if (it != rows.begin()) {
                int j = *it, p = *prev(it);

                st.emplace(-db(a[j] - a[p]) / (j - p), p, last[p] = iter);
            }
        }
    }

    int x = 0, y = 0;
    ll ans = 0;

    while (x < n - 1 || y < m - 1) {
        if (x < n - 1 && (y == m - 1 || when[x] > when[y + n])) {
            ans += b[y];
            x += 1;
        } else {
            ans += a[x];
            y += 1;
        }
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 468 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -