oj.uz

답안 #949760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949760 2024-03-19T16:15:31 Z steveonalex Feast (NOI19_feast) C++14
41 / 100
 1000 ms 12628 KB 
#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};
    for(int i = 1; i<=n; ++i){
        update(dp[i], dp[i-1]);

        for(int j = i; j>=1; --j){
            ll sum = pref[i] - pref[j-1];
            update(dp[i], {dp[j-1].first + sum - lambda, dp[j-1].second + 1});
        }
    }
    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
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 12368 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1058 ms 10588 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1103 ms 12628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 3 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 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 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 3 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 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 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 4 ms 2396 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 3 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 3 ms 2532 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 3 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 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 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 4 ms 2396 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 3 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 3 ms 2532 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 87 ms 2396 KB Output is correct
22 Correct 90 ms 2572 KB Output is correct
23 Correct 91 ms 2396 KB Output is correct
24 Correct 88 ms 2396 KB Output is correct
25 Correct 94 ms 2572 KB Output is correct
26 Correct 100 ms 2780 KB Output is correct
27 Correct 95 ms 2580 KB Output is correct
28 Correct 90 ms 2580 KB Output is correct
29 Correct 90 ms 2396 KB Output is correct
30 Correct 86 ms 2396 KB Output is correct

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 12368 KB Time limit exceeded
2 Halted 0 ms 0 KB -