oj.uz

Submission #401496

# Submission time Handle Problem Language Result Execution time Memory
401496 2021-05-10T12:10:30 Z tranxuanbach Peru (RMI20_peru) C++17
49 / 100
 145 ms 87044 KB 
#include "peru.h"
#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;

// #pragma GCC optimize("O3,unroll-loops,no-stack-protector")
// #pragma GCC target("mmx,sse,sse2,sse3,ssse3,sse4,avx,avx2,fma")

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <pii> vpii;
typedef vector <vi> vvi;

const int N = 4e5 + 5, M = 19, mod = 1e9 + 7;
const ll infll = (ld)1e18 + 7;

namespace {
    deque <pair <int, ll>> dq;
    multiset <ll> mtsdp;
    ll dp[N];
    int sparse[M][N];

    deque <int> dq2;

    int convert(int n){
        int ans = 0;
        For(i, 0, n){
            ans = (ll)ans * 23 % mod;
            ans += dp[i] % mod;
            if (ans >= mod){
                ans -= mod;
            }
        }
        return ans;
    }
}

int solve(int n, int k, int* a){
    For(i, 0, n){
        sparse[0][i] = a[i];
    }
    For(j, 1, M){
        ForE(i, 0, n - (1 << j)){
            sparse[j][i] = max(sparse[j - 1][i], sparse[j - 1][i + (1 << (j - 1))]);
        }
    }
    if (k == 1){
        For(i, 0, n){
            dp[i] = dp[i - 1] + a[i];
        }
        return convert(n);
    }
    For(i, 0, n){
        int val = 0;
        while (!dq.empty() and a[dq.front().fi] <= a[i]){
            mtsdp.erase(mtsdp.find(dq.front().se));
            val = a[dq.front().fi];
            dq.pop_front();
        }
        if (!dq.empty()){
            mtsdp.erase(mtsdp.find(dq.front().se));
            dq.front().se -= val;
            dq.front().se += a[i];
            mtsdp.insert(dq.front().se);
        }
        while (!dq2.empty() and a[dq2.front()] <= a[i]){
            dq2.pop_front();
        }
        dq2.push_front(i);
        dp[i] = infll;
        if (!mtsdp.empty()){
            dp[i] = *mtsdp.begin();
        }
        dp[i] = min(dp[i], a[dq2.back()] + (i >= k ? dp[i - k] : 0));
        dq.push_front(make_pair(i, dp[i]));
        mtsdp.insert(dp[i]);
        if (!dq.empty() and dq.back().fi == i - k + 1){
            mtsdp.erase(mtsdp.find(dq.back().se));
            dq.pop_back();
        }
        if (!dq2.empty() and dq2.back() == i - k + 1){
            dq2.pop_back();
        }
    }
    // For(i, 0, n){
    //     cout << dp[i] << ' ';
    // } cout << endl;
    return convert(n);
}


/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
18.0 / 18.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 111 ms 32812 KB Output is correct
16 Correct 108 ms 32892 KB Output is correct
17 Correct 118 ms 32880 KB Output is correct
18 Correct 96 ms 32840 KB Output is correct
19 Correct 108 ms 32840 KB Output is correct
20 Correct 92 ms 32828 KB Output is correct
21 Correct 113 ms 32880 KB Output is correct
22 Correct 128 ms 32964 KB Output is correct
23 Correct 145 ms 33128 KB Output is correct
24 Correct 112 ms 32848 KB Output is correct
25 Correct 112 ms 32908 KB Output is correct
26 Correct 117 ms 32868 KB Output is correct
27 Correct 127 ms 32932 KB Output is correct
28 Correct 116 ms 32948 KB Output is correct
29 Correct 111 ms 33184 KB Output is correct
30 Correct 117 ms 32912 KB Output is correct
31 Correct 124 ms 32864 KB Output is correct
32 Correct 122 ms 33032 KB Output is correct
33 Correct 127 ms 32764 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 32812 KB Output is correct
2 Correct 108 ms 32892 KB Output is correct
3 Correct 118 ms 32880 KB Output is correct
4 Correct 96 ms 32840 KB Output is correct
5 Correct 108 ms 32840 KB Output is correct
6 Correct 92 ms 32828 KB Output is correct
7 Correct 113 ms 32880 KB Output is correct
8 Correct 128 ms 32964 KB Output is correct
9 Correct 145 ms 33128 KB Output is correct
10 Correct 112 ms 32848 KB Output is correct
11 Correct 112 ms 32908 KB Output is correct
12 Correct 117 ms 32868 KB Output is correct
13 Correct 127 ms 32932 KB Output is correct
14 Correct 116 ms 32948 KB Output is correct
15 Correct 111 ms 33184 KB Output is correct
16 Correct 117 ms 32912 KB Output is correct
17 Correct 124 ms 32864 KB Output is correct
18 Correct 122 ms 33032 KB Output is correct
19 Correct 127 ms 32764 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Runtime error 130 ms 87044 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -