답안 #949765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
949765	2024-03-19T16:22:32 Z	steveonalex	Feast (NOI19_feast)	C++14	100 / 100	115 ms	12908 KB

feast

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3e5;

int n, k;
ll a[N];
ll pref[N];

pair<ll, int> dp[N];

void update(pair<ll, int> &a, pair<ll, int> b){
    if (a.first < b.first) a = b;
    else if (a.first == b.first && a.second > b.second) a = b;
}

pair<ll, int> go(ll lambda){
    for(int i = 0; i<=n; ++i) dp[i] = {0, 0};

    pair<ll, int> mi = {0, 0};
    for(int i = 1; i<=n; ++i){
        update(dp[i], dp[i-1]);
        update(dp[i], {mi.first + pref[i] - lambda, mi.second + 1});
        update(mi, make_pair(dp[i].first - pref[i], dp[i].second));
    }
    return dp[n];
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> k;
    for(int i= 1; i<=n; ++i) cin >> a[i];
    for(int i = 1; i<=n; ++i) pref[i] = pref[i-1] + a[i];

    ll l = 0, r = 1e14;
    while(l < r){
        ll mid = (l + r) >> 1;
        if (go(mid).second <= k) r = mid;
        else l = mid + 1;
    }
    pair<ll, int> eww = go(l);
    cout << eww.first + k * l << "\n";

    return 0;
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	9564 KB	Output is correct
2	Correct	57 ms	12376 KB	Output is correct
3	Correct	60 ms	12716 KB	Output is correct
4	Correct	57 ms	12644 KB	Output is correct
5	Correct	70 ms	12368 KB	Output is correct
6	Correct	54 ms	12372 KB	Output is correct
7	Correct	54 ms	12380 KB	Output is correct
8	Correct	63 ms	12612 KB	Output is correct
9	Correct	55 ms	12440 KB	Output is correct
10	Correct	55 ms	12444 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	9560 KB	Output is correct
2	Correct	55 ms	10844 KB	Output is correct
3	Correct	54 ms	10592 KB	Output is correct
4	Correct	50 ms	10840 KB	Output is correct
5	Correct	66 ms	12432 KB	Output is correct
6	Correct	50 ms	10588 KB	Output is correct
7	Correct	51 ms	10840 KB	Output is correct
8	Correct	57 ms	12668 KB	Output is correct
9	Correct	81 ms	12396 KB	Output is correct
10	Correct	55 ms	10840 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	105 ms	11544 KB	Output is correct
2	Correct	84 ms	12480 KB	Output is correct
3	Correct	85 ms	12628 KB	Output is correct
4	Correct	78 ms	12656 KB	Output is correct
5	Correct	79 ms	12612 KB	Output is correct
6	Correct	80 ms	12628 KB	Output is correct
7	Correct	80 ms	12852 KB	Output is correct
8	Correct	79 ms	12628 KB	Output is correct
9	Correct	81 ms	12888 KB	Output is correct
10	Correct	80 ms	12624 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2648 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct

Subtask #5
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2648 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2648 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	2 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	2 ms	2396 KB	Output is correct
26	Correct	1 ms	2544 KB	Output is correct
27	Correct	1 ms	2392 KB	Output is correct
28	Correct	1 ms	2536 KB	Output is correct
29	Correct	1 ms	2648 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct

Subtask #7
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	9564 KB	Output is correct
2	Correct	57 ms	12376 KB	Output is correct
3	Correct	60 ms	12716 KB	Output is correct
4	Correct	57 ms	12644 KB	Output is correct
5	Correct	70 ms	12368 KB	Output is correct
6	Correct	54 ms	12372 KB	Output is correct
7	Correct	54 ms	12380 KB	Output is correct
8	Correct	63 ms	12612 KB	Output is correct
9	Correct	55 ms	12440 KB	Output is correct
10	Correct	55 ms	12444 KB	Output is correct
11	Correct	53 ms	9560 KB	Output is correct
12	Correct	55 ms	10844 KB	Output is correct
13	Correct	54 ms	10592 KB	Output is correct
14	Correct	50 ms	10840 KB	Output is correct
15	Correct	66 ms	12432 KB	Output is correct
16	Correct	50 ms	10588 KB	Output is correct
17	Correct	51 ms	10840 KB	Output is correct
18	Correct	57 ms	12668 KB	Output is correct
19	Correct	81 ms	12396 KB	Output is correct
20	Correct	55 ms	10840 KB	Output is correct
21	Correct	105 ms	11544 KB	Output is correct
22	Correct	84 ms	12480 KB	Output is correct
23	Correct	85 ms	12628 KB	Output is correct
24	Correct	78 ms	12656 KB	Output is correct
25	Correct	79 ms	12612 KB	Output is correct
26	Correct	80 ms	12628 KB	Output is correct
27	Correct	80 ms	12852 KB	Output is correct
28	Correct	79 ms	12628 KB	Output is correct
29	Correct	81 ms	12888 KB	Output is correct
30	Correct	80 ms	12624 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2392 KB	Output is correct
36	Correct	1 ms	2392 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2648 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2392 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2392 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2396 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2392 KB	Output is correct
51	Correct	1 ms	2396 KB	Output is correct
52	Correct	1 ms	2396 KB	Output is correct
53	Correct	2 ms	2396 KB	Output is correct
54	Correct	1 ms	2396 KB	Output is correct
55	Correct	2 ms	2396 KB	Output is correct
56	Correct	1 ms	2544 KB	Output is correct
57	Correct	1 ms	2392 KB	Output is correct
58	Correct	1 ms	2536 KB	Output is correct
59	Correct	1 ms	2648 KB	Output is correct
60	Correct	1 ms	2396 KB	Output is correct
61	Correct	111 ms	12640 KB	Output is correct
62	Correct	110 ms	12896 KB	Output is correct
63	Correct	91 ms	12368 KB	Output is correct
64	Correct	115 ms	12812 KB	Output is correct
65	Correct	115 ms	12628 KB	Output is correct
66	Correct	111 ms	12636 KB	Output is correct
67	Correct	113 ms	12624 KB	Output is correct
68	Correct	83 ms	12908 KB	Output is correct
69	Correct	78 ms	12628 KB	Output is correct
70	Correct	77 ms	12368 KB	Output is correct

답안 #949765

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 8.0 / 8.0

Subtask #3 18.0 / 18.0

Subtask #4 10.0 / 10.0

Subtask #5 11.0 / 11.0

Subtask #6 20.0 / 20.0

Subtask #7 29.0 / 29.0

Subtask #1
4.0 / 4.0

Subtask #2
8.0 / 8.0

Subtask #3
18.0 / 18.0

Subtask #4
10.0 / 10.0

Subtask #5
11.0 / 11.0

Subtask #6
20.0 / 20.0

Subtask #7
29.0 / 29.0