제출 #1296946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1296946		dosts	Peru (RMI20_peru)	C++20	0 / 100	1099 ms	49284 KiB

peru

#include "peru.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e18;

const int N = 1e5+1;
int add(int x,int y) {
    if ((x + y) >= MOD) return x + y - MOD;
    return x + y;
}

int mult(int x,int y) {
    return (1LL * x * y) % MOD;
}

int expo(int x,int y) {
    if (!y) return 1;
    int e = expo(x, y >> 1);
    e = mult(e, e);
    if (y & 1) e = mult(e, x);
    return e;
}

signed solve(signed n, signed k, signed* v){
    vi a(n+1);
    for (int i=1;i<=n;i++) a[i] = v[i-1];
    vi dp(n+1,inf);
    dp[0] = 0;
    a[0] = inf;
    deque<int> stk;
    for (int i=0;i<=n;i++) {
        while (!stk.empty() && a[stk.back()] <= a[i]) {
            stk.pop_back();
        }
        stk.push_back(i);
        while (stk.front() <= i-k) stk.pop_front();
        for (int j = 0;j<big(stk);j++) {
            if (j) dp[i] = min(dp[i],a[stk[j]]+dp[stk[j-1]]);
            else dp[i] = min(dp[i],a[stk[j]]+dp[max(0ll,i-k)]);
        }
    }
/*     for (int j = 1;j<=n;j++) cerr << dp[j] << ' ';
    cerr << '\n'; */
    int mlt = 1;
    int ans = 0;
    for (int i = n;i>=1;i--) {
        ans = add(ans,mult(dp[i],mlt));
        mlt = mult(mlt,23);
    }
    return ans;
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 31
• Subtask 3: 0 / 51