Submission #797897

#	Time	Username	Problem	Language	Result	Execution time	Memory
797897		resting	Meetings (IOI18_meetings)	C++17	100 / 100	1739 ms	135676 KiB

meetings

#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 (stderr)

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 / 4
• Subtask 2: 15 / 15
• Subtask 3: 17 / 17
• Subtask 4: 24 / 24
• Subtask 5: 40 / 40