oj.uz

Submission #596568

# Submission time Handle Problem Language Result Execution time Memory
596568 2022-07-14T20:36:10 Z ThegeekKnight16 Peru (RMI20_peru) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#include <peru.h>
using namespace std;
typedef long long int ll;
const int MAXN = 25e5 + 10;
ll dp[MAXN], v[MAXN];
ll seg[4*MAXN];
ll expoente[MAXN];
ll modulo = 1e9 + 7;
 
ll query(int pos, int ini, int fim, int p, int q)
{
  	if (p > q) swap(p, q);
    if (q < ini || p > fim) return -1;
    if (p <= ini && fim <= q) return seg[pos];
    int m = (ini + fim) / 2;
    int e = 2*pos; int d = 2*pos + 1;
    return max(query(e, ini, m, p, q), query(d, m+1, fim, p, q));
}
 
void build(int pos, int ini, int fim)
{
    if (ini == fim) {seg[pos] = v[ini]; return;}
    int m = (ini + fim) / 2;
    int e = 2*pos; int d = 2*pos + 1;
    build(e, ini,  m );
    build(d, m+1, fim);
    seg[pos] = max(seg[e], seg[d]);
}
 
ll fat(int k)
{
    if (k == 0) return 1LL;
    if (expoente[k] != 0) return expoente[k];
    //cerr << "fat(" << k << "): " << (23 * fat(k-1)) % (modulo) << '\n';
    return expoente[k] = (23 * fat(k-1)) % (modulo);
}
 
int solve(int N, int K, int* S)
{
    for (int i = 1; i <= N; i++) {v[i] = (ll)*S; S++;}
    //build(1, 1, N);
    
    for (int i = 1; i <= K; i++) {dp[i] = max(dp[i-1], v[i]);}
    for (int i = 1; i <= K; i++) {dp[i] = dp[i] % modulo;}
    
    for (int i = K+1; i <= N; i++)
    {
      ll Max = 1;
      //cerr << "i : " << i << '\n';
      for (int k = i - K + 1; k <= i; k++) {Max = max(Max, v[k]);}
      //cerr << '\n';
      //cerr << Max << '\n';
      dp[i] = (dp[i-K] + (Max % (modulo))) % (modulo);
    }
    
    //for (int i = 1; i <= N; i++) cerr << dp[i] << " ";
    
    int resp = 0;
    for (int i = 1; i <= N; i++) {resp += (dp[i] * fat(N - i)) % (modulo); resp = resp % (modulo);}
    return resp;
}
 
/*int main()
{
    int N, K;
    cin >> N >> K;
    int vetor[N+10];
    for (int i = 0; i < N; i++) cin >> vetor[i];
    cout << solve(N, K, vetor);
}
*/

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 -