oj.uz

Submission #317908

# Submission time Handle Problem Language Result Execution time Memory
317908 2020-10-30T19:17:07 Z anubhavdhar K blocks (IZhO14_blocks) C++14
0 / 100
 1 ms 384 KB 
#include<bits/stdc++.h>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first 
#define ss second
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define FOR(i,N) for(i=0;i<(N);++i)
#define FORe(i,N) for(i=1;i<=(N);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,N) for(i=(N);i>=0;--i)
#define F0R(i,N) for(int i=0;i<(N);++i)
#define F0Re(i,N) for(int i=1;i<=(N);++i)
#define F0Rr(i,a,b) for(ll i=(a);i<(b);++i)
#define F0Rrev(i,N) for(int i=(N);i>=0;--i)
#define all(v) (v).begin(),(v).end()
#define dbgLine cerr<<" LINE : "<<__LINE__<<"\n"
#define ldd long double

using namespace std;

const int Alp = 26;
const int __PRECISION = 9;
const int inf = 1e9 + 8;

const ldd PI = acos(-1);
const ldd EPS = 1e-7;

const ll MOD = 1e9 + 7;
const ll MAXN = 2e5 + 5;
const ll ROOTN = 320;
const ll LOGN = 18;
const ll INF = 1e18 + 1022;

ll dp[101][100001], A[100001], N, K;

signed main(){

	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	

	cin>>N>>K;
	F0Re(i, N){
		cin>>A[i];
	}

	dp[1][0] = 0;
	F0Re(i, N){
		dp[1][i] = max(dp[1][i-1], A[i]);
	}
	F0Re(k, K){
		dp[k][0] = INF;
	}

	F0Rr(k, 2, K+1){
		stack<pair<ll, pll>> S; // (A[i], (minDp[i], i))
		F0Re(i, N){
			ll mn = dp[k-1][i-1];
			dp[k][i] = INF;
			while((!S.empty()) && (S.top().ff <= A[i])){
				mn = min(mn, S.top().ss.ff);
				S.pop();
			}

			if(!S.empty()){
				dp[k][i] = dp[k][max(k, S.top().ff)];
			}

			dp[k][i] = min(dp[k][i], mn + A[i]);
			S.push(mp(A[i], mp(min(dp[k-1][i], mn), i)));
		}
	}

	/*F0Re(j, K){
		F0Re(i, N){
			cerr<<"dp["<<j<<"]["<<i<<"] = "<<(dp[j][i] < INF ? dp[j][i] : -1)<<'\n';
		}
	}*/
  
  cout<<dp[K][N]<<'\n';
	
	return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -