oj.uz

Submission #830395

# Submission time Handle Problem Language Result Execution time Memory
830395 2023-08-19T05:41:08 Z GrindMachine Peru (RMI20_peru) C++17
18 / 100
 600 ms 12368 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];
    a[0] = inf2;

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

    deque<ll> b;

    rep1(i,n){
        while(!b.empty() and a[i] > a[b.back()]){
            b.pop_back();
        }

        while(!b.empty() and b.front() < i-k){
            b.pop_front();
        }

        b.pb(i);
    
        rep1(j,sz(b)-1){
            ll val = a[b[j]]+dp[b[j-1]];
            amin(dp[i],val);
        }

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

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

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

    return ans;
}

Compilation message

peru.cpp: In function 'int solve(int, int, int*)':
peru.cpp:31:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 | #define rep1(i, n) for(int i = 1; i <= n; ++i)
......
   85 |         rep1(j,sz(b)-1){
      |              ~~~~~~~~~               
peru.cpp:85:9: note: in expansion of macro 'rep1'
   85 |         rep1(j,sz(b)-1){
      |         ^~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 245 ms 9160 KB Output is correct
16 Correct 237 ms 9164 KB Output is correct
17 Correct 308 ms 9156 KB Output is correct
18 Correct 27 ms 9132 KB Output is correct
19 Correct 26 ms 9112 KB Output is correct
20 Correct 25 ms 9036 KB Output is correct
21 Correct 353 ms 12244 KB Output is correct
22 Execution timed out 919 ms 12368 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 9160 KB Output is correct
2 Correct 237 ms 9164 KB Output is correct
3 Correct 308 ms 9156 KB Output is correct
4 Correct 27 ms 9132 KB Output is correct
5 Correct 26 ms 9112 KB Output is correct
6 Correct 25 ms 9036 KB Output is correct
7 Correct 353 ms 12244 KB Output is correct
8 Execution timed out 919 ms 12368 KB Time limit exceeded
9 Halted 0 ms 0 KB -