oj.uz

Submission #797897

# Submission time Handle Problem Language Result Execution time Memory
797897 2023-07-30T05:43:23 Z resting Meetings (IOI18_meetings) C++17
100 / 100
 1739 ms 135676 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int n, q;

vector<ll> helper(vector<int32_t> h, vector<int32_t> l, vector<int32_t> r) {
    vector<vector<pair<int, int>>> qq(n);
    for (int i = 0; i < q; i++) qq[r[i]].push_back({ l[i], i });
    vector<ll> c(q);
    ll curad = 0;
    set <pair<int, pair<ll, ll>>> s; //position, {const, slope}
    vector<pair<int, pair<ll, int>>> st; // index, {value, height} 
    vector<vector<int>> overtake(n + 1);

    auto find_overtake = [&](pair<ll, ll> a, pair<ll, ll>b) -> int { // when a overtakes b as smallest iykyk
        assert(b.second >= a.second); // or its the other way around
        if (a.first <= b.first && a.second <= b.second) return 0;
        if (b.first <= a.first && b.second <= a.second) return n;
        int div = b.second - a.second;
        return (int)min((ll)n, (a.first - b.first + (div - 1)) / div);
    };

    for (int i = 0; i < n; i++) {
        while (st.size() && st.back().second.second < h[i]) st.pop_back();
        if (st.size())curad = st.back().second.first + (ll)(i - st.back().first) * h[i];
        else curad = (ll)(i + 1) * h[i];
        st.push_back({ i, {curad, h[i]} });

        //merge set
        ll mn = curad - (ll)h[i] * i;int mni = i;
        while (s.size() && prev(s.end())->second.second < h[i]) {
            ll t = prev(s.end())->second.first + prev(s.end())->second.second * (i - 1) - (ll)h[i] * (i - 1);
            if (t < mn) {
                mn = t; mni = prev(s.end())->first;
            }
            s.erase(prev(s.end()));
        }
        s.insert({ mni, {mn, h[i]} });
        if (s.size() > 1) {
            overtake[max(i, min(n, find_overtake(prev(s.end())->second, prev(prev(s.end()))->second)))].push_back(prev(s.end())->first);
        }

        for (int k = 0; k < overtake[i].size(); k++) {
            auto& x = overtake[i][k];
            auto t = s.lower_bound({ x, {(ll)-1e18, (ll)-1e18} });
            if (t == s.begin() || t == s.end() || t->first != x) continue;
            auto p = prev(t);
            if (p->second.first + p->second.second * i < t->second.first + t->second.second * i) continue;
            s.erase(p);
            if (t == s.begin()) continue;
            auto pp = prev(t);
            overtake[max(i, min(n, find_overtake(t->second, pp->second)))].push_back(t->first);
        }


        for (auto& x : qq[i]) {
            c[x.second] = 1e18;
            int l = x.first;
            auto owo = lower_bound(st.begin(), st.end(), pair<int, pair<ll, int>>({ l, {(ll)-1e18, (int)-1e9 } }));
            auto lll = s.lower_bound({ owo->first, {(ll)-1e18, (ll)-1e18} });
            if (lll == s.end()) continue;
            c[x.second] = lll->second.first + lll->second.second * i - owo->second.first + (ll)(owo->first - l + 1) * owo->second.second;
        }
    }

    return c;
}

vector<ll> minimum_costs(vector<int32_t> h, vector<int32_t> l, vector<int32_t> r) {
    n = h.size(); q = l.size();
    vector<ll> a = helper(h, l, r);
    reverse(h.begin(), h.end());
    for (int i = 0; i < q; i++) { swap(l[i], r[i]); l[i] = n - 1 - l[i]; r[i] = n - 1 - r[i]; }
    vector<ll> b = helper(h, l, r);
    vector<ll> c(q); for (int i = 0; i < q;i++) c[i] = min(a[i], b[i]);
    for (int i = 0; i < q; i++) {
        if (c[i] == 1e18)
            c[i] = (ll)(r[i] - l[i] + 1) * h[l[i]];
    }
    return c;
}

Compilation message

meetings.cpp: In function 'std::vector<long long int> helper(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:46:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int k = 0; k < overtake[i].size(); k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 4 ms 980 KB Output is correct
12 Correct 5 ms 980 KB Output is correct
13 Correct 4 ms 980 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 27 ms 3540 KB Output is correct
3 Correct 107 ms 15868 KB Output is correct
4 Correct 84 ms 15772 KB Output is correct
5 Correct 85 ms 17020 KB Output is correct
6 Correct 81 ms 18028 KB Output is correct
7 Correct 97 ms 17332 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 27 ms 3540 KB Output is correct
3 Correct 107 ms 15868 KB Output is correct
4 Correct 84 ms 15772 KB Output is correct
5 Correct 85 ms 17020 KB Output is correct
6 Correct 81 ms 18028 KB Output is correct
7 Correct 97 ms 17332 KB Output is correct
8 Correct 103 ms 14480 KB Output is correct
9 Correct 78 ms 13640 KB Output is correct
10 Correct 94 ms 15592 KB Output is correct
11 Correct 101 ms 14376 KB Output is correct
12 Correct 77 ms 13508 KB Output is correct
13 Correct 97 ms 15456 KB Output is correct
14 Correct 102 ms 15480 KB Output is correct
15 Correct 86 ms 14168 KB Output is correct
16 Correct 91 ms 16508 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 4 ms 980 KB Output is correct
12 Correct 5 ms 980 KB Output is correct
13 Correct 4 ms 980 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 27 ms 3540 KB Output is correct
18 Correct 107 ms 15868 KB Output is correct
19 Correct 84 ms 15772 KB Output is correct
20 Correct 85 ms 17020 KB Output is correct
21 Correct 81 ms 18028 KB Output is correct
22 Correct 97 ms 17332 KB Output is correct
23 Correct 103 ms 14480 KB Output is correct
24 Correct 78 ms 13640 KB Output is correct
25 Correct 94 ms 15592 KB Output is correct
26 Correct 101 ms 14376 KB Output is correct
27 Correct 77 ms 13508 KB Output is correct
28 Correct 97 ms 15456 KB Output is correct
29 Correct 102 ms 15480 KB Output is correct
30 Correct 86 ms 14168 KB Output is correct
31 Correct 91 ms 16508 KB Output is correct
32 Correct 960 ms 105636 KB Output is correct
33 Correct 612 ms 99508 KB Output is correct
34 Correct 1151 ms 114328 KB Output is correct
35 Correct 1018 ms 105672 KB Output is correct
36 Correct 647 ms 99692 KB Output is correct
37 Correct 1157 ms 114376 KB Output is correct
38 Correct 1205 ms 115380 KB Output is correct
39 Correct 1739 ms 135676 KB Output is correct
40 Correct 1085 ms 114052 KB Output is correct
41 Correct 886 ms 111212 KB Output is correct
42 Correct 943 ms 111660 KB Output is correct
43 Correct 950 ms 111724 KB Output is correct
44 Correct 1042 ms 104884 KB Output is correct