oj.uz

Submission #1116532

# Submission time Handle Problem Language Result Execution time Memory
1116532 2024-11-21T19:03:32 Z Mher777 K blocks (IZhO14_blocks) C++17
100 / 100
 462 ms 51272 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 100005, M = 105, L = 20;
int a[N], near[N], dp[N][M], st[N][L], pref[N];
int n, k, lg;

void bld(int kx) {
    for (int i = 1; i <= n; ++i) {
        st[i][0] = dp[i][kx];
    }
    for (int l = 1; l <= lg; ++l) {
        for (int i = 1; i + (1 << l) - 1 <= n; ++i) {
            st[i][l] = min(st[i][l - 1], st[i + (1 << (l - 1))][l - 1]);
        }
    }
}

int qry(int l, int r) {
    int lgx = log2(r - l + 1);
    return min(st[l][lgx], st[r - (1 << lgx) + 1][lgx]);
}

void slv() {
    cin >> n >> k;
    lg = log2(n);
    int ans = MAX;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        pref[i] = max(pref[i - 1], a[i]);
    }
    near[n] = n + 1;
    dp[n][1] = a[n];
    for (int i = n - 1; i >= 1; --i) {
        int ind = i + 1;
        while (ind <= n) {
            if (a[ind] > a[i]) break;
            ind = near[ind];
        }
        near[i] = ind;
        if (near[i] == n + 1) {
            dp[i][1] = a[i];
        }
        else {
            dp[i][1] = dp[i + 1][1];
        }
    }
    bld(1);
    for (int kx = 2; kx <= k; ++kx) {
        for (int i = n; i > n - kx + 1; --i) {
            dp[i][kx] = MAX;
        }
        for (int i = n - kx + 1; i >= 1; --i) {
            int r = near[i];
            if (r == n + 1) --r;
            dp[i][kx] = qry(i + 1, r) + a[i];
            if (a[r] > a[i]) {
                dp[i][kx] = min(dp[i][kx], dp[r][kx]);
            }
        }
        if (kx == k) break;
        bld(kx);
    }
    for (int i = 1; i <= n; ++i) {
        if (pref[i] != a[i]) break;
        ans = min(ans, dp[i][k]);
    }
    cout << ans;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

blocks.cpp: In function 'll range_sum(ll, ll)':
blocks.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
blocks.cpp: In function 'll bin_to_dec(std::string)':
blocks.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4432 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 1 ms 6648 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6652 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4432 KB Output is correct
19 Correct 2 ms 4572 KB Output is correct
20 Correct 1 ms 4432 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4432 KB Output is correct
19 Correct 1 ms 4432 KB Output is correct
20 Correct 1 ms 4432 KB Output is correct
21 Correct 1 ms 4432 KB Output is correct
22 Correct 1 ms 6648 KB Output is correct
23 Correct 1 ms 6480 KB Output is correct
24 Correct 1 ms 6652 KB Output is correct
25 Correct 1 ms 4432 KB Output is correct
26 Correct 1 ms 6480 KB Output is correct
27 Correct 1 ms 4432 KB Output is correct
28 Correct 1 ms 4432 KB Output is correct
29 Correct 1 ms 4432 KB Output is correct
30 Correct 1 ms 4432 KB Output is correct
31 Correct 1 ms 4432 KB Output is correct
32 Correct 1 ms 4432 KB Output is correct
33 Correct 1 ms 4432 KB Output is correct
34 Correct 1 ms 4432 KB Output is correct
35 Correct 1 ms 4432 KB Output is correct
36 Correct 1 ms 4432 KB Output is correct
37 Correct 2 ms 4572 KB Output is correct
38 Correct 1 ms 4432 KB Output is correct
39 Correct 2 ms 4432 KB Output is correct
40 Correct 2 ms 4688 KB Output is correct
41 Correct 1 ms 4432 KB Output is correct
42 Correct 1 ms 4432 KB Output is correct
43 Correct 1 ms 4432 KB Output is correct
44 Correct 1 ms 4432 KB Output is correct
45 Correct 1 ms 4432 KB Output is correct
46 Correct 1 ms 4476 KB Output is correct
47 Correct 1 ms 4432 KB Output is correct
48 Correct 1 ms 4432 KB Output is correct
49 Correct 1 ms 4432 KB Output is correct
50 Correct 2 ms 4600 KB Output is correct
51 Correct 1 ms 4432 KB Output is correct
52 Correct 1 ms 4432 KB Output is correct
53 Correct 1 ms 4432 KB Output is correct
54 Correct 1 ms 4432 KB Output is correct
55 Correct 1 ms 4432 KB Output is correct
56 Correct 2 ms 4432 KB Output is correct
57 Correct 2 ms 4600 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4432 KB Output is correct
19 Correct 1 ms 4432 KB Output is correct
20 Correct 1 ms 4432 KB Output is correct
21 Correct 1 ms 4432 KB Output is correct
22 Correct 1 ms 6648 KB Output is correct
23 Correct 1 ms 6480 KB Output is correct
24 Correct 1 ms 6652 KB Output is correct
25 Correct 1 ms 4432 KB Output is correct
26 Correct 1 ms 6480 KB Output is correct
27 Correct 1 ms 4432 KB Output is correct
28 Correct 1 ms 4432 KB Output is correct
29 Correct 1 ms 4432 KB Output is correct
30 Correct 1 ms 4432 KB Output is correct
31 Correct 1 ms 4432 KB Output is correct
32 Correct 1 ms 4432 KB Output is correct
33 Correct 1 ms 4432 KB Output is correct
34 Correct 1 ms 4432 KB Output is correct
35 Correct 1 ms 4432 KB Output is correct
36 Correct 1 ms 4432 KB Output is correct
37 Correct 2 ms 4572 KB Output is correct
38 Correct 1 ms 4432 KB Output is correct
39 Correct 2 ms 4432 KB Output is correct
40 Correct 2 ms 4688 KB Output is correct
41 Correct 1 ms 4432 KB Output is correct
42 Correct 1 ms 4432 KB Output is correct
43 Correct 1 ms 4432 KB Output is correct
44 Correct 1 ms 4432 KB Output is correct
45 Correct 1 ms 4432 KB Output is correct
46 Correct 1 ms 4476 KB Output is correct
47 Correct 1 ms 4432 KB Output is correct
48 Correct 1 ms 4432 KB Output is correct
49 Correct 1 ms 4432 KB Output is correct
50 Correct 2 ms 4600 KB Output is correct
51 Correct 1 ms 4432 KB Output is correct
52 Correct 1 ms 4432 KB Output is correct
53 Correct 1 ms 4432 KB Output is correct
54 Correct 1 ms 4432 KB Output is correct
55 Correct 1 ms 4432 KB Output is correct
56 Correct 2 ms 4432 KB Output is correct
57 Correct 2 ms 4600 KB Output is correct
58 Correct 11 ms 7504 KB Output is correct
59 Correct 14 ms 25168 KB Output is correct
60 Correct 25 ms 25368 KB Output is correct
61 Correct 144 ms 23396 KB Output is correct
62 Correct 439 ms 51272 KB Output is correct
63 Correct 42 ms 51016 KB Output is correct
64 Correct 235 ms 51176 KB Output is correct
65 Correct 2 ms 6652 KB Output is correct
66 Correct 2 ms 6648 KB Output is correct
67 Correct 2 ms 4432 KB Output is correct
68 Correct 1 ms 4688 KB Output is correct
69 Correct 2 ms 4688 KB Output is correct
70 Correct 2 ms 4688 KB Output is correct
71 Correct 34 ms 7504 KB Output is correct
72 Correct 4 ms 7504 KB Output is correct
73 Correct 11 ms 7504 KB Output is correct
74 Correct 18 ms 23376 KB Output is correct
75 Correct 24 ms 23376 KB Output is correct
76 Correct 146 ms 25168 KB Output is correct
77 Correct 416 ms 51028 KB Output is correct
78 Correct 43 ms 51016 KB Output is correct
79 Correct 218 ms 51016 KB Output is correct
80 Correct 37 ms 51016 KB Output is correct
81 Correct 69 ms 51272 KB Output is correct
82 Correct 420 ms 51024 KB Output is correct
83 Correct 2 ms 8528 KB Output is correct
84 Correct 2 ms 8528 KB Output is correct
85 Correct 31 ms 10892 KB Output is correct
86 Correct 4 ms 10728 KB Output is correct
87 Correct 11 ms 7740 KB Output is correct
88 Correct 16 ms 23376 KB Output is correct
89 Correct 28 ms 23408 KB Output is correct
90 Correct 154 ms 23444 KB Output is correct
91 Correct 462 ms 51016 KB Output is correct
92 Correct 44 ms 51024 KB Output is correct
93 Correct 218 ms 51024 KB Output is correct
94 Correct 3 ms 10996 KB Output is correct
95 Correct 32 ms 10832 KB Output is correct
96 Correct 2 ms 8696 KB Output is correct
97 Correct 2 ms 8580 KB Output is correct
98 Correct 2 ms 6480 KB Output is correct
99 Correct 1 ms 6648 KB Output is correct