oj.uz

Submission #859623

# Submission time Handle Problem Language Result Execution time Memory
859623 2023-10-10T11:37:43 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;

    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 );
        dp[i] = v[dq.front()] + ( i >= k ? dp[i - k] : 0 );
        for ( int j = 1; j < (int)dq.size(); j ++ ) {
            dp[i] = min( dp[i], dp[dq[j - 1]] + v[dq[j]] );
        }
        ans = ( (long long)ans * 23 + dp[i] ) % MOD;
    }
    dq.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 -