제출 #647126

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647126		ghostwriter	K개의 묶음 (IZhO14_blocks)	C++14	100 / 100	297 ms	83412 KiB

blocks

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
struct Element {
	int maxv, cur, minp;
	Element() {}
	Element(int maxv, ll cur, ll minp) : maxv(maxv), cur(cur), minp(minp) {}
};
const int oo = 1e9 + 5;
const int N = 1e5 + 1;
const int K = 101;
int n, k, a[N], d[N][K];
deque<Element> d1[K];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> k;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 0, k) d[1][i] = oo;
    d[1][1] = a[1];
    FOR(i, 0, k) d1[i].pb(Element(a[1], d[1][i], d[1][i]));
    FOR(i, 2, n) {
		FOR(j, 0, k) {
			int curv = (j? d[i - 1][j - 1] + a[i] : oo);
			d1[j].pb(Element(a[i], curv, min(curv, (d1[j].empty()? oo : d1[j].bk().minp))));
			int minv = oo;
			WHILE(!d1[j].empty() && d1[j].bk().maxv <= a[i]) {
				minv = min(minv, d1[j].bk().cur + a[i] - d1[j].bk().maxv);
				d1[j]._pb();
			}
			d1[j].pb(Element(a[i], minv, min(minv, d1[j].empty()? oo : d1[j].bk().minp)));
		}
		d[i][0] = oo;
		FOR(j, 1, k) d[i][j] = d1[j].bk().minp;
	}
    cout << d[n][k];
    return 0;
}
/*
2 2
1 2
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'int main()':
blocks.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
blocks.cpp:66:5: note: in expansion of macro 'FOR'
   66 |     FOR(i, 1, n) cin >> a[i];
      |     ^~~
blocks.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
blocks.cpp:67:5: note: in expansion of macro 'FOR'
   67 |     FOR(i, 0, k) d[1][i] = oo;
      |     ^~~
blocks.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
blocks.cpp:69:5: note: in expansion of macro 'FOR'
   69 |     FOR(i, 0, k) d1[i].pb(Element(a[1], d[1][i], d[1][i]));
      |     ^~~
blocks.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
blocks.cpp:70:5: note: in expansion of macro 'FOR'
   70 |     FOR(i, 2, n) {
      |     ^~~
blocks.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
blocks.cpp:71:3: note: in expansion of macro 'FOR'
   71 |   FOR(j, 0, k) {
      |   ^~~
blocks.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
blocks.cpp:82:3: note: in expansion of macro 'FOR'
   82 |   FOR(j, 1, k) d[i][j] = d1[j].bk().minp;
      |   ^~~

• Subtask 1: 14 / 14
• Subtask 2: 18 / 18
• Subtask 3: 21 / 21
• Subtask 4: 47 / 47