oj.uz

Submission #858853

# Submission time Handle Problem Language Result Execution time Memory
858853 2023-10-09T09:21:10 Z alexdumitru Peru (RMI20_peru) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

long long getAns(long long dp[], long long n)
{
    long long mul = 1;
    long long ans = 0;
    const long long MOD = 1e9 + 7;
    for(long long i = n - 1; i >= 0; i--)
    {
        ans = (1LL * ans + dp[i] * mul) % MOD;
        mul = (1LL * mul * 23) % MOD;
    }
    return ans;
}

int solve(int n, int k, int *s)
{
    long long dp[n];
    long long Max = 0;
    for(long long i = 0; i < k; i++)
    {
        if(s[i] > Max)
            Max = s[i];
        dp[i] = Max;
    }
    for(long long i = k; i < n; i++)
    {
        long long currMax = s[i];
        dp[i] = LLONG_MAX;
        for(long long j = i - 1; j >= i - k; j--)
        {
            if(dp[i] > dp[j] + currMax)
                dp[i] = dp[j] + currMax;
            if(s[j] > currMax)
                currMax = s[j];
        }
    }
    return getAns(dp, n);
}

Subtask #1
0 / 18.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 51.0

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