oj.uz

답안 #686698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
686698 2023-01-25T18:58:35 Z pragmatist K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 2 ms 340 KB 
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
 
#include<bits/stdc++.h>
 
#define ld long double
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"
 
using namespace std;
 
const int N = (int)1e5 + 7; // make sure this is right
const int M = (int)1e6 + 7;
const int inf = (int)2e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)998244353; // make sure this is right
 
bool bit(int x, int i) {
	return x >> i & 1;
}
 
int sum(int x, int y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}
 
int mult(int x, int y) {
	return 1ll * x * y % MOD;
}
 
int n, k, a[N];
ll dp[N][101], mn[N];
 
void solve() {
	cin >> n >> k;
	for(int i = 0; i <= n; ++i) {
		for(int j = 0; j <= k; ++j) {
			dp[i][j] = INF;
		}
	}
	int cur = 0;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		cur = max(cur, a[i]);
		dp[i][1] = cur;
	}
	dp[0][0] = 0;       
	for(int j = 2; j <= k; ++j) {
		stack<pair<int, ll> > st;	
		for(int i = 1; i <= n; ++i) {
		    mn[i] = dp[i - 1][j - 1];
			while(!st.empty() && a[st.top().x] <= a[i]) {
			    mn[i] = min(mn[i], st.top().y);
				st.pop();	
			}  
			if(!st.empty()) {
				dp[i][j] = min(dp[i][j], st.top().y);
			}
			if(st.empty() || mn[i] + a[i] < a[st.top().x] + st.top().y) {
				st.push({i, mn[i]});	
			}
			dp[i][j] = min(dp[i][j], mn[i] + a[i]);
		}
	}
	cout << dp[n][k];
}	
 
signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 2 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 2 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 2 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -