oj.uz

Submission #859654

# Submission time Handle Problem Language Result Execution time Memory
859654 2023-10-10T12:15:53 Z Tudy006 Peru (RMI20_peru) C++14
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
#include "peru.h"

using namespace std;

const int NMAX = 2500000;
const int MOD = 1e9 + 7;

long long dp[NMAX];

int solve( int n, int k, int* v ) {
    deque <int> dq;
    deque <pair<int, long long>> dq2;

    int ans = 0;
    for ( int i = 0; i < n; i ++ ) {
        while ( !dq.empty() && v[dq.back()] <= v[i] ) dq.pop_back();
        dq.push_back( i );

        if ( dq.front() <= i - k ) dq.pop_front();
        dp[i] = v[dq.front()] + ( i >= k ? dp[i - k] : 0 );

        while ( !dq2.empty() && v[dq2.back().first] <= v[i] ) dq2.pop_back();

        if ( dq.size() > 1 ) {
            long long aux = v[i] + dp[dq[dq.size() - 2]];

            while ( !dq2.empty() && dq2.back().second >= aux ) dq2.pop_back();

            dq2.push_back( { i, aux } );
            if ( dq2.front().first <= i - k ) dq2.pop_front();

            dp[i] = min( dp[i], dq2.front().second );
        }
//        cout << dp[i] << ' ';
        ans = ( (long long)ans * 23 + dp[i] ) % MOD;
    }
//    cout << endl;
    dq.clear();
    dq2.clear();
    return ans;
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 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 2396 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 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -