oj.uz

Submission #830398

# Submission time Handle Problem Language Result Execution time Memory
830398 2023-08-19T05:46:27 Z GrindMachine Peru (RMI20_peru) C++17
100 / 100
 360 ms 78916 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "peru.h"

int solve(int n, int k, int* v){
    vector<ll> a(n+5);
    rep(i,n) a[i+1] = v[i];

    vector<ll> dp(n+5,inf2);
    dp[0] = 0;

    deque<ll> dq;
    multiset<ll> ms;

    rep1(i,n){
        while(!dq.empty() and a[i] > a[dq.back()]){
            ll j1 = dq.back();
            dq.pop_back();
            if(!dq.empty()){
                ll j2 = dq.back();
                ms.erase(ms.find(a[j1]+dp[j2]));
            }
        }

        while(!dq.empty() and dq.front() < i-k){
            ll j2 = dq.front();
            dq.pop_front();
            if(!dq.empty()){
                ll j1 = dq.front();
                ms.erase(ms.find(a[j1]+dp[j2]));
            }
        }

        if(!dq.empty()){
            ll j = dq.back();
            ms.insert(a[i]+dp[j]);
        }

        dq.pb(i);

        if(!ms.empty()){
            dp[i] = *ms.begin();
        }

        amin(dp[i],dp[max(i-k,0)]+a[dq[0]]);
    }

    // rep1(i,n){
    //     cout << dp[i] << " ";
    // }
    // cout << endl;

    ll ans = 0;
    rep1(i,n){
        ans = ans*23 + dp[i];
        ans %= MOD;
    }

    return ans;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 47 ms 8276 KB Output is correct
16 Correct 47 ms 8308 KB Output is correct
17 Correct 48 ms 8276 KB Output is correct
18 Correct 37 ms 8256 KB Output is correct
19 Correct 36 ms 8148 KB Output is correct
20 Correct 36 ms 8288 KB Output is correct
21 Correct 47 ms 8284 KB Output is correct
22 Correct 54 ms 8276 KB Output is correct
23 Correct 49 ms 12488 KB Output is correct
24 Correct 49 ms 12364 KB Output is correct
25 Correct 48 ms 12400 KB Output is correct
26 Correct 48 ms 12280 KB Output is correct
27 Correct 48 ms 12364 KB Output is correct
28 Correct 47 ms 12340 KB Output is correct
29 Correct 44 ms 12548 KB Output is correct
30 Correct 54 ms 12412 KB Output is correct
31 Correct 48 ms 12368 KB Output is correct
32 Correct 48 ms 12520 KB Output is correct
33 Correct 48 ms 12256 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 8276 KB Output is correct
2 Correct 47 ms 8308 KB Output is correct
3 Correct 48 ms 8276 KB Output is correct
4 Correct 37 ms 8256 KB Output is correct
5 Correct 36 ms 8148 KB Output is correct
6 Correct 36 ms 8288 KB Output is correct
7 Correct 47 ms 8284 KB Output is correct
8 Correct 54 ms 8276 KB Output is correct
9 Correct 49 ms 12488 KB Output is correct
10 Correct 49 ms 12364 KB Output is correct
11 Correct 48 ms 12400 KB Output is correct
12 Correct 48 ms 12280 KB Output is correct
13 Correct 48 ms 12364 KB Output is correct
14 Correct 47 ms 12340 KB Output is correct
15 Correct 44 ms 12548 KB Output is correct
16 Correct 54 ms 12412 KB Output is correct
17 Correct 48 ms 12368 KB Output is correct
18 Correct 48 ms 12520 KB Output is correct
19 Correct 48 ms 12256 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 301 ms 73024 KB Output is correct
35 Correct 301 ms 73328 KB Output is correct
36 Correct 304 ms 73308 KB Output is correct
37 Correct 307 ms 73184 KB Output is correct
38 Correct 314 ms 73352 KB Output is correct
39 Correct 307 ms 73288 KB Output is correct
40 Correct 335 ms 73284 KB Output is correct
41 Correct 310 ms 73136 KB Output is correct
42 Correct 322 ms 73404 KB Output is correct
43 Correct 116 ms 29756 KB Output is correct
44 Correct 137 ms 45264 KB Output is correct
45 Correct 147 ms 45004 KB Output is correct
46 Correct 139 ms 45072 KB Output is correct
47 Correct 314 ms 75452 KB Output is correct
48 Correct 319 ms 75564 KB Output is correct
49 Correct 319 ms 75944 KB Output is correct
50 Correct 300 ms 77152 KB Output is correct
51 Correct 319 ms 76640 KB Output is correct
52 Correct 346 ms 78916 KB Output is correct
53 Correct 317 ms 77576 KB Output is correct
54 Correct 320 ms 73168 KB Output is correct
55 Correct 291 ms 73104 KB Output is correct
56 Correct 288 ms 73020 KB Output is correct
57 Correct 295 ms 73172 KB Output is correct
58 Correct 304 ms 73180 KB Output is correct
59 Correct 309 ms 73220 KB Output is correct
60 Correct 308 ms 73156 KB Output is correct
61 Correct 360 ms 75400 KB Output is correct
62 Correct 339 ms 75556 KB Output is correct
63 Correct 332 ms 75188 KB Output is correct