Submission #492050

#TimeUsernameProblemLanguageResultExecution timeMemory
492050blueMeetings (IOI18_meetings)C++17
4 / 100
5570 ms1600 KiB
#include "meetings.h"
#include <vector>
#include <algorithm>
using namespace std;

using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;

const ll INF = 1'000'000'000'000'000'000LL;

vll minimum_costs(vi H, vi L, vi R)
{
    int Q = int(L.size());

    vll ans(Q);

    for(int j = 0; j < Q; j++)
    {
        ans[j] = INF;
        for(int p = L[j]; p <= R[j]; p++)
        {
            ll tmp = -H[p];
            ll mx = 0;
            for(int i = p; i >= L[j]; i--)
            {
                mx = max(mx, ll(H[i]));
                tmp += mx;
            }
            mx = 0;
            for(int i = p; i <= R[j]; i++)
            {
                mx = max(mx, ll(H[i]));
                tmp += mx;
            }

            ans[j] = min(ans[j], tmp);
        }
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...