oj.uz

Submission #219982

# Submission time Handle Problem Language Result Execution time Memory
219982 2020-04-06T18:52:45 Z toxic_hack K blocks (IZhO14_blocks) C++14
100 / 100
 337 ms 83440 KB 
// g++ -std=c++14
 
/*
 
Today might be the chance to grasp the chance to let your talent bloom.
May be tomorrow, the day after, or next year...
May be even when you are 30. I'm not sure if physique has anything to do with it
but if you think that it will never come, it probably never will.
 
- Tooru Oikawa.
 
*/
 
 
#include<bits/stdc++.h>
 
typedef long long ll;
typedef long double lld;
using namespace std;
 
#define endl "\n"
#define fi first
#define se second
#define MEMS(a,b) memset(a,b,sizeof(a))
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define __ freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(c) c.begin(),c.end()
#define pii pair<int, int>
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	uniform_int_distribution<int> uid(l, r);
	return uid(rng);
}
 
#define tr(...) cout<<__FUNCTION__<<' '<<__LINE__<<" = ";trace(#__VA_ARGS__, __VA_ARGS__)
template<typename S, typename T>
ostream& operator<<(ostream& out,pair<S,T> const& p){out<<'('<<p.fi<<", "<<p.se<<')';return out;}
 
template<typename T>
ostream& operator<<(ostream& out,vector<T> const& v){
ll l=v.size();for(ll i=0;i<l-1;i++)out<<v[i]<<' ';if(l>0)out<<v[l-1];return out;}
 
template <typename T>
ostream &operator<<(ostream &out, set<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T>
ostream &operator<<(ostream &out, multiset<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T, typename V>
ostream &operator<<(ostream &out, map<T, V> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << "\n" << (i->first) <<  ":"  << (i->second);
    return out;
}
 
template<typename T>
void trace(const char* name, T&& arg1){cout<<name<<" : "<<arg1<<endl;}
 
template<typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma-names)<<" : "<<arg1<<" | ";trace(comma+1,args...);}
 
#define int ll
const int N = 1e5 + 100;
const int K = 102;
const ll inf = 1e18;
int arr[N], n, k;
 
ll dp[N][K];
int solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < K; j++) {
            dp[i][j] = inf;
        }
    }
 
    dp[0][0] = 0;
    vector<pair<pair<int, ll>, ll>> vec;
	for (int j = 1; j <= k; j++) {
		vec.clear();
		for (int i = 1; i <= n; i++) {
			ll mn = dp[i - 1][j - 1];
			while (!vec.empty() && vec.back().fi.fi <= arr[i]) {
				mn = min(mn, vec.back().fi.se);
				vec.pop_back();
			}
			ll val = arr[i] + mn;
			if (!vec.empty()) 
				val = min(val, vec.back().se);
				
			vec.push_back({{arr[i], mn}, val});
			dp[i][j] = val;
		}
	}
    cout << dp[n][k] << endl;
    return 0;
 
}
 
int32_t main(){ _
    int t;
    // cin >> t;
    t = 1;
    while (t--) solve();
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 80248 KB Output is correct
2 Correct 46 ms 80248 KB Output is correct
3 Correct 46 ms 80248 KB Output is correct
4 Correct 47 ms 80248 KB Output is correct
5 Correct 46 ms 80248 KB Output is correct
6 Correct 47 ms 80248 KB Output is correct
7 Correct 46 ms 80248 KB Output is correct
8 Correct 48 ms 80248 KB Output is correct
9 Correct 46 ms 80248 KB Output is correct
10 Correct 45 ms 80248 KB Output is correct
11 Correct 46 ms 80248 KB Output is correct
12 Correct 46 ms 80248 KB Output is correct
13 Correct 48 ms 80248 KB Output is correct
14 Correct 46 ms 80248 KB Output is correct
15 Correct 46 ms 80248 KB Output is correct
16 Correct 47 ms 80248 KB Output is correct
17 Correct 46 ms 80248 KB Output is correct
18 Correct 46 ms 80248 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 80248 KB Output is correct
2 Correct 45 ms 80248 KB Output is correct
3 Correct 46 ms 80248 KB Output is correct
4 Correct 48 ms 80212 KB Output is correct
5 Correct 47 ms 80252 KB Output is correct
6 Correct 46 ms 80248 KB Output is correct
7 Correct 45 ms 80248 KB Output is correct
8 Correct 46 ms 80248 KB Output is correct
9 Correct 46 ms 80248 KB Output is correct
10 Correct 50 ms 80632 KB Output is correct
11 Correct 46 ms 80248 KB Output is correct
12 Correct 45 ms 80256 KB Output is correct
13 Correct 46 ms 80256 KB Output is correct
14 Correct 45 ms 80248 KB Output is correct
15 Correct 47 ms 80248 KB Output is correct
16 Correct 46 ms 80256 KB Output is correct
17 Correct 46 ms 80248 KB Output is correct
18 Correct 46 ms 80248 KB Output is correct
19 Correct 46 ms 80248 KB Output is correct
20 Correct 45 ms 80248 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 80248 KB Output is correct
2 Correct 46 ms 80248 KB Output is correct
3 Correct 48 ms 80248 KB Output is correct
4 Correct 46 ms 80248 KB Output is correct
5 Correct 46 ms 80296 KB Output is correct
6 Correct 45 ms 80248 KB Output is correct
7 Correct 45 ms 80248 KB Output is correct
8 Correct 45 ms 80248 KB Output is correct
9 Correct 52 ms 80504 KB Output is correct
10 Correct 46 ms 80256 KB Output is correct
11 Correct 46 ms 80248 KB Output is correct
12 Correct 46 ms 80248 KB Output is correct
13 Correct 47 ms 80248 KB Output is correct
14 Correct 46 ms 80248 KB Output is correct
15 Correct 49 ms 80376 KB Output is correct
16 Correct 47 ms 80248 KB Output is correct
17 Correct 46 ms 80248 KB Output is correct
18 Correct 46 ms 80248 KB Output is correct
19 Correct 46 ms 80248 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 80376 KB Output is correct
2 Correct 53 ms 80888 KB Output is correct
3 Correct 57 ms 80888 KB Output is correct
4 Correct 118 ms 80888 KB Output is correct
5 Correct 308 ms 81656 KB Output is correct
6 Correct 64 ms 81784 KB Output is correct
7 Correct 167 ms 81660 KB Output is correct
8 Correct 47 ms 80248 KB Output is correct
9 Correct 46 ms 80248 KB Output is correct
10 Correct 46 ms 80248 KB Output is correct
11 Correct 47 ms 80248 KB Output is correct
12 Correct 52 ms 80248 KB Output is correct
13 Correct 46 ms 80248 KB Output is correct
14 Correct 67 ms 80376 KB Output is correct
15 Correct 47 ms 80376 KB Output is correct
16 Correct 52 ms 80376 KB Output is correct
17 Correct 53 ms 80888 KB Output is correct
18 Correct 62 ms 81016 KB Output is correct
19 Correct 126 ms 80888 KB Output is correct
20 Correct 331 ms 81656 KB Output is correct
21 Correct 65 ms 81656 KB Output is correct
22 Correct 185 ms 81796 KB Output is correct
23 Correct 59 ms 81784 KB Output is correct
24 Correct 86 ms 81656 KB Output is correct
25 Correct 337 ms 81656 KB Output is correct
26 Correct 46 ms 80256 KB Output is correct
27 Correct 47 ms 80248 KB Output is correct
28 Correct 66 ms 80640 KB Output is correct
29 Correct 48 ms 80632 KB Output is correct
30 Correct 52 ms 80632 KB Output is correct
31 Correct 53 ms 81468 KB Output is correct
32 Correct 58 ms 81464 KB Output is correct
33 Correct 132 ms 81464 KB Output is correct
34 Correct 323 ms 83440 KB Output is correct
35 Correct 65 ms 83440 KB Output is correct
36 Correct 192 ms 83440 KB Output is correct
37 Correct 47 ms 80376 KB Output is correct
38 Correct 64 ms 80384 KB Output is correct
39 Correct 48 ms 80248 KB Output is correct
40 Correct 47 ms 80248 KB Output is correct
41 Correct 47 ms 80248 KB Output is correct
42 Correct 59 ms 80380 KB Output is correct