oj.uz

Submission #667751

# Submission time Handle Problem Language Result Execution time Memory
667751 2022-12-02T01:25:29 Z Soul234 K blocks (IZhO14_blocks) C++14
100 / 100
 175 ms 2604 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
#define fi first
#define se second

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
using db = long double;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;
const ll INF = 1e18;

struct Dat {
    int mx, predp, mndp;
};

const int MX = 1e5+5;

int N, K, A[MX];

int dp[2][MX];

void solve() {
    cin >> N >> K;
    FOR(i,1,N+1) cin >> A[i];
    memset(dp, 0x3f, sizeof dp);
    dp[0][0] = 0;
    FOR(k,1,K+1) {
//        memset(dp[k&1], 0x3f, sizeof dp[k&1]);
        stack<Dat> st;
        FOR(i,k,N+1) {
            int predp = dp[k&1^1][i-1];
            while(sz(st) && st.top().mx <= A[i]) {
                ckmin(predp, st.top().predp);
                st.pop();
            }
            dp[k&1][i] = predp + A[i];
            if(sz(st)) {
                ckmin(dp[k&1][i], st.top().mndp);
            }
            int mndp = predp + A[i];
            if(sz(st)) ckmin(mndp, st.top().mndp);
            st.push({A[i], predp, mndp});
        }
    }
    cout << dp[K&1][N] << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

blocks.cpp: In function 'void solve()':
blocks.cpp:72:29: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   72 |             int predp = dp[k&1^1][i-1];
      |                            ~^~
blocks.cpp: In function 'void setIO(std::string)':
blocks.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1092 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1088 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 1 ms 1092 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 1092 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 1 ms 980 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1096 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1108 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 1 ms 980 KB Output is correct
46 Correct 1 ms 980 KB Output is correct
47 Correct 1 ms 1092 KB Output is correct
48 Correct 1 ms 1092 KB Output is correct
49 Correct 1 ms 1092 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 1 ms 1108 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1092 KB Output is correct
54 Correct 1 ms 980 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1108 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 5 ms 1108 KB Output is correct
59 Correct 5 ms 1492 KB Output is correct
60 Correct 8 ms 1472 KB Output is correct
61 Correct 44 ms 1568 KB Output is correct
62 Correct 126 ms 2180 KB Output is correct
63 Correct 13 ms 2168 KB Output is correct
64 Correct 61 ms 2252 KB Output is correct
65 Correct 1 ms 1108 KB Output is correct
66 Correct 1 ms 1108 KB Output is correct
67 Correct 1 ms 980 KB Output is correct
68 Correct 1 ms 1108 KB Output is correct
69 Correct 1 ms 1108 KB Output is correct
70 Correct 1 ms 1108 KB Output is correct
71 Correct 17 ms 1108 KB Output is correct
72 Correct 2 ms 1164 KB Output is correct
73 Correct 5 ms 1172 KB Output is correct
74 Correct 5 ms 1536 KB Output is correct
75 Correct 10 ms 1504 KB Output is correct
76 Correct 59 ms 1564 KB Output is correct
77 Correct 171 ms 2160 KB Output is correct
78 Correct 12 ms 2064 KB Output is correct
79 Correct 82 ms 2156 KB Output is correct
80 Correct 10 ms 2120 KB Output is correct
81 Correct 24 ms 2172 KB Output is correct
82 Correct 175 ms 2176 KB Output is correct
83 Correct 1 ms 1108 KB Output is correct
84 Correct 1 ms 1108 KB Output is correct
85 Correct 14 ms 1264 KB Output is correct
86 Correct 2 ms 1236 KB Output is correct
87 Correct 5 ms 1236 KB Output is correct
88 Correct 5 ms 1748 KB Output is correct
89 Correct 9 ms 1756 KB Output is correct
90 Correct 49 ms 1764 KB Output is correct
91 Correct 138 ms 2604 KB Output is correct
92 Correct 12 ms 2588 KB Output is correct
93 Correct 65 ms 2588 KB Output is correct
94 Correct 2 ms 1108 KB Output is correct
95 Correct 14 ms 1108 KB Output is correct
96 Correct 1 ms 1108 KB Output is correct
97 Correct 1 ms 1104 KB Output is correct
98 Correct 1 ms 980 KB Output is correct
99 Correct 1 ms 1108 KB Output is correct