oj.uz

Submission #949602

# Submission time Handle Problem Language Result Execution time Memory
949602 2024-03-19T11:54:45 Z Baizho K blocks (IZhO14_blocks) C++14
100 / 100
 177 ms 50628 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, k, a[N], dp[N][101], lo[N], st[30][N];
 
int get(int l, int r) {
    int j = lo[r - l + 1];
    return max(st[j][l], st[j][r - (1 << j) + 1]);
}
 
void Baizho() {
    for(int i = 2; i < N; i ++) lo[i] = lo[i / 2] + 1;
    cin>>n>>k;
    for(int i = 1; i <= n; i ++) {
        cin>>a[i];
        st[0][i] = a[i];
    }
    for(int j = 1; j <= 17; j ++) {
        for(int i = 1; i + (1 << j) - 1 <= n; i ++) {
            st[j][i] = max(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
        }
    }
    for(int i = 0; i <= n; i ++) for(int j = 0; j <= k; j ++) dp[i][j] = 2e9;
    dp[0][0] = 0;
     for(int kk = 1; kk <= k; kk ++) {
        vector<int> v1, v2;
        for(int i = kk; i <= n; i ++) {
            int cur = dp[i - 1][kk - 1];
            while(!v2.empty() && v2.back() < a[i]) {
                cur = min(cur, v1.back());
                v1.pop_back();
                v2.pop_back();
            } 
            if(v1.empty() || cur + a[i] < v1.back() + v2.back()) {
                v1.pb(cur), v2.pb(a[i]);
            }
            dp[i][kk] = v1.back() + v2.back();
        }
    }
    cout<<dp[n][k]<<"\n";
}
 
signed main() {     
//  Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
    // precalc();
    
    int ttt = 1;
   // cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

blocks.cpp: In function 'void Baizho()':
blocks.cpp:53:64: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   53 |             st[j][i] = max(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
      |                                                              ~~^~~
blocks.cpp: In function 'void Freopen(std::string)':
blocks.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 3160 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2904 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2904 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2904 KB Output is correct
24 Correct 1 ms 3160 KB Output is correct
25 Correct 1 ms 2908 KB Output is correct
26 Correct 1 ms 2908 KB Output is correct
27 Correct 1 ms 2908 KB Output is correct
28 Correct 1 ms 2904 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct
30 Correct 1 ms 2908 KB Output is correct
31 Correct 1 ms 2908 KB Output is correct
32 Correct 1 ms 2908 KB Output is correct
33 Correct 1 ms 2908 KB Output is correct
34 Correct 1 ms 2908 KB Output is correct
35 Correct 1 ms 2904 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct
37 Correct 1 ms 2904 KB Output is correct
38 Correct 1 ms 2908 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 0 ms 860 KB Output is correct
41 Correct 1 ms 2908 KB Output is correct
42 Correct 1 ms 2908 KB Output is correct
43 Correct 1 ms 2908 KB Output is correct
44 Correct 1 ms 2908 KB Output is correct
45 Correct 1 ms 2908 KB Output is correct
46 Correct 1 ms 2908 KB Output is correct
47 Correct 1 ms 2908 KB Output is correct
48 Correct 1 ms 2908 KB Output is correct
49 Correct 1 ms 2908 KB Output is correct
50 Correct 1 ms 2908 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 1 ms 4956 KB Output is correct
53 Correct 1 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 1 ms 4956 KB Output is correct
57 Correct 1 ms 4956 KB Output is correct
58 Correct 4 ms 11356 KB Output is correct
59 Correct 9 ms 26460 KB Output is correct
60 Correct 9 ms 26476 KB Output is correct
61 Correct 31 ms 26460 KB Output is correct
62 Correct 113 ms 49764 KB Output is correct
63 Correct 20 ms 49752 KB Output is correct
64 Correct 58 ms 49840 KB Output is correct
65 Correct 1 ms 4956 KB Output is correct
66 Correct 1 ms 4956 KB Output is correct
67 Correct 1 ms 4956 KB Output is correct
68 Correct 1 ms 4956 KB Output is correct
69 Correct 2 ms 7260 KB Output is correct
70 Correct 2 ms 7260 KB Output is correct
71 Correct 11 ms 11612 KB Output is correct
72 Correct 3 ms 11608 KB Output is correct
73 Correct 4 ms 11608 KB Output is correct
74 Correct 8 ms 26340 KB Output is correct
75 Correct 10 ms 26460 KB Output is correct
76 Correct 35 ms 26340 KB Output is correct
77 Correct 100 ms 49756 KB Output is correct
78 Correct 18 ms 49744 KB Output is correct
79 Correct 53 ms 49752 KB Output is correct
80 Correct 15 ms 49756 KB Output is correct
81 Correct 22 ms 49696 KB Output is correct
82 Correct 102 ms 49748 KB Output is correct
83 Correct 2 ms 7260 KB Output is correct
84 Correct 2 ms 7260 KB Output is correct
85 Correct 11 ms 11608 KB Output is correct
86 Correct 3 ms 11612 KB Output is correct
87 Correct 5 ms 11612 KB Output is correct
88 Correct 7 ms 26460 KB Output is correct
89 Correct 11 ms 26736 KB Output is correct
90 Correct 50 ms 26784 KB Output is correct
91 Correct 177 ms 50532 KB Output is correct
92 Correct 20 ms 50228 KB Output is correct
93 Correct 78 ms 50628 KB Output is correct
94 Correct 4 ms 11612 KB Output is correct
95 Correct 8 ms 11612 KB Output is correct
96 Correct 2 ms 7260 KB Output is correct
97 Correct 2 ms 7260 KB Output is correct
98 Correct 1 ms 2908 KB Output is correct
99 Correct 1 ms 2908 KB Output is correct