oj.uz

Submission #789582

# Submission time Handle Problem Language Result Execution time Memory
789582 2023-07-21T14:16:09 Z nasam K blocks (IZhO14_blocks) C++17
100 / 100
 184 ms 85416 KB 
#include <bits/stdc++.h>
#define ll long long
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define FOD(i,b,a) for (int i = (b), _a = (a); i >= _a; i--)
#define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define CNTBIT(x) __builtin_popcount(x)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define left ___left
#define right ___right
#define pii pair<int, int>
#define DEBUG(n, a) FOR (i, 1, n) cout << a[i] << ' '; cout << endl;1234567890
#define lob lower_bound // >=
#define upb upper_bound // >
#define endl "\n"

using namespace std;

template<class X, class Y> bool maximize(X &x, Y y){ if (x < y){ x = y; return true; } return false; }
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y){ x = y; return true; } return false; }

#define  gogobruhbruh  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }

int MOD = 1e9 + 7;

int add(int &a, int b){ if ((a += b) >= MOD) a -= MOD; return a; }
int sub(int a, int b){ if ((a -= b) < 0) a += MOD; return a; }
int muti(int a, int b){ return (1LL * a * b) % MOD; }
int Pow(int x, int y){ int res = 1; for (; y; y >>= 1){ if (y & 1) res = muti(res, x); x = muti(x, x); } return res; }

const int MAX = 1e5 + 7;
const ll INF = 1e14;
const int K = 1e2 + 7;

int num, lim;
int val[MAX];
ll dp[MAX][K];
stack<pii> st;

void solve(){
    dp[0][1] = INF;
    FOR (j, 2, lim){
        while (st.size())
            st.pop();
        FOR (i, 1, num){
            ll Min = dp[i - 1][j - 1];
            while (st.size() && val[st.top().se] <= val[i])
                minimize(Min, st.top().fi),
                st.pop();
            int L = st.empty() ? 0 : st.top().se;
            dp[i][j] = min(dp[L][j], Min + val[i]);
//            cout << L << ' ' << dp[i - 1][j - 1] << endl;
            st.push({Min, i});
        }
    }
    cout << dp[num][lim];
}

void read(){
    memset(dp, 0x3f, sizeof(dp));
    dp[0][1] = 0;
    cin >> num >> lim;
    FOR (i, 1, num)
        cin >> val[i],
        dp[i][1] = max(dp[i - 1][1], (ll) val[i]);
}

int main(){
    gogobruhbruh;
    file("main");
    int test = 1;
//    cin >> test;
    while (test--)
        read(),
        solve();
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:28:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:76:5: note: in expansion of macro 'file'
   76 |     file("main");
      |     ^~~~
blocks.cpp:28:95: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                                                       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:76:5: note: in expansion of macro 'file'
   76 |     file("main");
      |     ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 84044 KB Output is correct
2 Correct 29 ms 84008 KB Output is correct
3 Correct 29 ms 83996 KB Output is correct
4 Correct 29 ms 83972 KB Output is correct
5 Correct 30 ms 83948 KB Output is correct
6 Correct 30 ms 84172 KB Output is correct
7 Correct 30 ms 84040 KB Output is correct
8 Correct 30 ms 84036 KB Output is correct
9 Correct 30 ms 84064 KB Output is correct
10 Correct 30 ms 84084 KB Output is correct
11 Correct 30 ms 84064 KB Output is correct
12 Correct 32 ms 84036 KB Output is correct
13 Correct 31 ms 84052 KB Output is correct
14 Correct 30 ms 84092 KB Output is correct
15 Correct 30 ms 84076 KB Output is correct
16 Correct 30 ms 84032 KB Output is correct
17 Correct 30 ms 84044 KB Output is correct
18 Correct 31 ms 84016 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 83996 KB Output is correct
2 Correct 30 ms 84052 KB Output is correct
3 Correct 29 ms 84072 KB Output is correct
4 Correct 31 ms 83992 KB Output is correct
5 Correct 30 ms 84132 KB Output is correct
6 Correct 30 ms 84076 KB Output is correct
7 Correct 30 ms 84088 KB Output is correct
8 Correct 31 ms 84052 KB Output is correct
9 Correct 29 ms 84076 KB Output is correct
10 Correct 30 ms 83984 KB Output is correct
11 Correct 30 ms 83996 KB Output is correct
12 Correct 30 ms 84028 KB Output is correct
13 Correct 31 ms 83968 KB Output is correct
14 Correct 31 ms 84060 KB Output is correct
15 Correct 30 ms 84052 KB Output is correct
16 Correct 31 ms 84056 KB Output is correct
17 Correct 31 ms 84068 KB Output is correct
18 Correct 33 ms 83984 KB Output is correct
19 Correct 34 ms 84016 KB Output is correct
20 Correct 33 ms 84012 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 84044 KB Output is correct
2 Correct 29 ms 84008 KB Output is correct
3 Correct 29 ms 83996 KB Output is correct
4 Correct 29 ms 83972 KB Output is correct
5 Correct 30 ms 83948 KB Output is correct
6 Correct 30 ms 84172 KB Output is correct
7 Correct 30 ms 84040 KB Output is correct
8 Correct 30 ms 84036 KB Output is correct
9 Correct 30 ms 84064 KB Output is correct
10 Correct 30 ms 84084 KB Output is correct
11 Correct 30 ms 84064 KB Output is correct
12 Correct 32 ms 84036 KB Output is correct
13 Correct 31 ms 84052 KB Output is correct
14 Correct 30 ms 84092 KB Output is correct
15 Correct 30 ms 84076 KB Output is correct
16 Correct 30 ms 84032 KB Output is correct
17 Correct 30 ms 84044 KB Output is correct
18 Correct 31 ms 84016 KB Output is correct
19 Correct 31 ms 83996 KB Output is correct
20 Correct 30 ms 84052 KB Output is correct
21 Correct 29 ms 84072 KB Output is correct
22 Correct 31 ms 83992 KB Output is correct
23 Correct 30 ms 84132 KB Output is correct
24 Correct 30 ms 84076 KB Output is correct
25 Correct 30 ms 84088 KB Output is correct
26 Correct 31 ms 84052 KB Output is correct
27 Correct 29 ms 84076 KB Output is correct
28 Correct 30 ms 83984 KB Output is correct
29 Correct 30 ms 83996 KB Output is correct
30 Correct 30 ms 84028 KB Output is correct
31 Correct 31 ms 83968 KB Output is correct
32 Correct 31 ms 84060 KB Output is correct
33 Correct 30 ms 84052 KB Output is correct
34 Correct 31 ms 84056 KB Output is correct
35 Correct 31 ms 84068 KB Output is correct
36 Correct 33 ms 83984 KB Output is correct
37 Correct 34 ms 84016 KB Output is correct
38 Correct 33 ms 84012 KB Output is correct
39 Correct 31 ms 84052 KB Output is correct
40 Correct 37 ms 84044 KB Output is correct
41 Correct 37 ms 83988 KB Output is correct
42 Correct 31 ms 84072 KB Output is correct
43 Correct 31 ms 84068 KB Output is correct
44 Correct 31 ms 84052 KB Output is correct
45 Correct 33 ms 84052 KB Output is correct
46 Correct 31 ms 83980 KB Output is correct
47 Correct 31 ms 84072 KB Output is correct
48 Correct 31 ms 83972 KB Output is correct
49 Correct 31 ms 83952 KB Output is correct
50 Correct 31 ms 83984 KB Output is correct
51 Correct 30 ms 84060 KB Output is correct
52 Correct 31 ms 84032 KB Output is correct
53 Correct 30 ms 84032 KB Output is correct
54 Correct 31 ms 84012 KB Output is correct
55 Correct 31 ms 83944 KB Output is correct
56 Correct 30 ms 84064 KB Output is correct
57 Correct 31 ms 84052 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 84044 KB Output is correct
2 Correct 29 ms 84008 KB Output is correct
3 Correct 29 ms 83996 KB Output is correct
4 Correct 29 ms 83972 KB Output is correct
5 Correct 30 ms 83948 KB Output is correct
6 Correct 30 ms 84172 KB Output is correct
7 Correct 30 ms 84040 KB Output is correct
8 Correct 30 ms 84036 KB Output is correct
9 Correct 30 ms 84064 KB Output is correct
10 Correct 30 ms 84084 KB Output is correct
11 Correct 30 ms 84064 KB Output is correct
12 Correct 32 ms 84036 KB Output is correct
13 Correct 31 ms 84052 KB Output is correct
14 Correct 30 ms 84092 KB Output is correct
15 Correct 30 ms 84076 KB Output is correct
16 Correct 30 ms 84032 KB Output is correct
17 Correct 30 ms 84044 KB Output is correct
18 Correct 31 ms 84016 KB Output is correct
19 Correct 31 ms 83996 KB Output is correct
20 Correct 30 ms 84052 KB Output is correct
21 Correct 29 ms 84072 KB Output is correct
22 Correct 31 ms 83992 KB Output is correct
23 Correct 30 ms 84132 KB Output is correct
24 Correct 30 ms 84076 KB Output is correct
25 Correct 30 ms 84088 KB Output is correct
26 Correct 31 ms 84052 KB Output is correct
27 Correct 29 ms 84076 KB Output is correct
28 Correct 30 ms 83984 KB Output is correct
29 Correct 30 ms 83996 KB Output is correct
30 Correct 30 ms 84028 KB Output is correct
31 Correct 31 ms 83968 KB Output is correct
32 Correct 31 ms 84060 KB Output is correct
33 Correct 30 ms 84052 KB Output is correct
34 Correct 31 ms 84056 KB Output is correct
35 Correct 31 ms 84068 KB Output is correct
36 Correct 33 ms 83984 KB Output is correct
37 Correct 34 ms 84016 KB Output is correct
38 Correct 33 ms 84012 KB Output is correct
39 Correct 31 ms 84052 KB Output is correct
40 Correct 37 ms 84044 KB Output is correct
41 Correct 37 ms 83988 KB Output is correct
42 Correct 31 ms 84072 KB Output is correct
43 Correct 31 ms 84068 KB Output is correct
44 Correct 31 ms 84052 KB Output is correct
45 Correct 33 ms 84052 KB Output is correct
46 Correct 31 ms 83980 KB Output is correct
47 Correct 31 ms 84072 KB Output is correct
48 Correct 31 ms 83972 KB Output is correct
49 Correct 31 ms 83952 KB Output is correct
50 Correct 31 ms 83984 KB Output is correct
51 Correct 30 ms 84060 KB Output is correct
52 Correct 31 ms 84032 KB Output is correct
53 Correct 30 ms 84032 KB Output is correct
54 Correct 31 ms 84012 KB Output is correct
55 Correct 31 ms 83944 KB Output is correct
56 Correct 30 ms 84064 KB Output is correct
57 Correct 31 ms 84052 KB Output is correct
58 Correct 34 ms 84092 KB Output is correct
59 Correct 32 ms 84496 KB Output is correct
60 Correct 37 ms 84488 KB Output is correct
61 Correct 73 ms 84544 KB Output is correct
62 Correct 162 ms 85136 KB Output is correct
63 Correct 40 ms 85096 KB Output is correct
64 Correct 91 ms 85108 KB Output is correct
65 Correct 31 ms 84060 KB Output is correct
66 Correct 32 ms 84040 KB Output is correct
67 Correct 31 ms 83980 KB Output is correct
68 Correct 31 ms 84000 KB Output is correct
69 Correct 32 ms 83992 KB Output is correct
70 Correct 31 ms 84048 KB Output is correct
71 Correct 45 ms 84108 KB Output is correct
72 Correct 35 ms 84172 KB Output is correct
73 Correct 36 ms 84188 KB Output is correct
74 Correct 34 ms 84472 KB Output is correct
75 Correct 40 ms 84432 KB Output is correct
76 Correct 83 ms 84544 KB Output is correct
77 Correct 184 ms 85120 KB Output is correct
78 Correct 40 ms 85068 KB Output is correct
79 Correct 102 ms 85068 KB Output is correct
80 Correct 37 ms 85040 KB Output is correct
81 Correct 51 ms 85092 KB Output is correct
82 Correct 181 ms 85084 KB Output is correct
83 Correct 31 ms 84024 KB Output is correct
84 Correct 33 ms 84008 KB Output is correct
85 Correct 43 ms 84172 KB Output is correct
86 Correct 31 ms 84196 KB Output is correct
87 Correct 34 ms 84200 KB Output is correct
88 Correct 33 ms 84460 KB Output is correct
89 Correct 36 ms 84580 KB Output is correct
90 Correct 77 ms 84592 KB Output is correct
91 Correct 180 ms 85416 KB Output is correct
92 Correct 45 ms 85356 KB Output is correct
93 Correct 97 ms 85324 KB Output is correct
94 Correct 31 ms 84180 KB Output is correct
95 Correct 41 ms 84112 KB Output is correct
96 Correct 30 ms 84100 KB Output is correct
97 Correct 30 ms 83960 KB Output is correct
98 Correct 30 ms 84020 KB Output is correct
99 Correct 30 ms 84088 KB Output is correct