oj.uz

Submission #636598

# Submission time Handle Problem Language Result Execution time Memory
636598 2022-08-29T16:40:44 Z stoyan_malinin Peru (RMI20_peru) C++14
0 / 100
 1 ms 340 KB 
#include "peru.h"
#ifdef _LOCAL_
    #include "grader.cpp"
#endif // _LOCAL_

#include <vector>
#include <deque>
#include <set>

using namespace std;

int rmq(int l, int r, const int *a)
{
    int maxVal = a[l];
    for(int i = l+1;i<=r;i++) maxVal = max(maxVal, a[i]);

    return maxVal;
}

int convertToAns(const vector<long long> &dp)
{
    long long p23 = 1, ans = 0;
    const long long mod = 1e9 + 7;

    for(int i = dp.size()-1;i>=0;i--)
    {
        ans = (ans + (dp[i]%mod)*p23)%mod;
        p23 = (p23*23)%mod;
    }

    return ans;
}

int solve(int n, int k, int* a)
{
    vector <long long> dp(n);

    dp[0] = a[0];
    deque <int> dq = {0};
    multiset <int> ms;

    long long prefMaxVal = a[0];
    for(int i = 1;i<n;i++)
    {
        dp[i] = 1e18;
        prefMaxVal = max(prefMaxVal, (long long)a[i]);
        if(i<k) dp[i] = min(dp[i], prefMaxVal);

        while(dq.empty()==false && i-dq.front()+1>k)
        {
            int j = dq.front();
            dq.pop_front();

            if(dq.empty()==false)
                ms.erase(ms.find(dp[j]+a[dq.front()]));
        }

        while(dq.empty()==false && a[dq.back()]<=a[i])
        {
            if(dq.size()>=2) ms.erase(ms.find(dp[*prev(prev(dq.end()))] + a[dq.back()]));
            dq.pop_back();
        }

        if(dq.empty()==false) ms.insert(dp[dq.back()]+a[i]);
        dq.push_back(i);

        int last = max(i-k, 0);
        if(dq.front()>last) dp[i] = min(dp[i], dp[last] + a[dq.front()]);

        if(ms.empty()==false)
            dp[i] = min(dp[i], (long long)*prev(ms.end()));

        /*
        cout << "dq:";for(int x: dq) cout << x << " ";
        cout << '\n';
        cout << "ms:";for(int x: ms) cout << x << " ";
        cout << '\n';

        cout << "dp[" << i << "] = " << dp[i] << '\n';
        */
    }

    return convertToAns(dp);
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -