Submission #399331

#TimeUsernameProblemLanguageResultExecution timeMemory
399331rocks03Peru (RMI20_peru)C++14
18 / 100
618 ms8844 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define ff first #define ss second #define pb push_back #define SZ(x) ((int)(x).size()) #define all(x) x.begin(), x.end() #define debug(x) cout << #x << ": " << x << " " #define nl cout << "\n" #define rep(i, a, b) for(int i = (a); i < (b); i++) #define per(i, a, b) for(int i = (a); i >= (b); i--) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int M = 1e9 + 7; int solve(int N, int K, int* a){ vector<ll> dp(N + 1, LLONG_MAX); dp[0] = 0; rep(i, 1, N + 1){ int mx = 0; per(j, i, max(1, i - K + 1)){ mx = max(mx, a[j - 1]); dp[i] = min(dp[i], dp[j - 1] + mx); } } vector<ll> pt(N + 1); pt[N] = 1; per(i, N - 1, 1){ pt[i] = (pt[i + 1] * 23ll) % M; } ll ans = 0; rep(i, 1, N + 1){ dp[i] %= M; pt[i] %= M; ans += (dp[i] * pt[i]) % M; ans %= M; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...