Submission #1273846

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273846		i_elhdad	Feast (NOI19_feast)	C++20	0 / 100	1095 ms	30684 KiB

feast

//    #pragma GCC optimize ("O3")
//    #pragma GCC optimize ("unroll-loops")  
//    #pragma comment(linker, "/STACK:2000000")  
#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define int ll
#define ld long double
#define  ui unsigned int
#define endl "\n"
#define FOCUS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

void Go() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

const int N = 3e5 + 5;
pair<int,int> dp[N][2];
vector<int> vals(N);
int C = 0;
int n, k;

pair<int,int> merge(pair<int,int> a, pair<int,int> b) {
    pair<int,int> ret;
    if (a.first > b.first) {
        ret = a;
    } else if (a.first == b.first) {
        if (a.second < b.second)ret = a;
        else ret = b;
    } else ret = b;
    return ret;
}

pair<int,int> solve(int idx,int open) {
    if (idx == n) {
        return {0, 0};
    }
    auto &ret = dp[idx][open];
    if (ret.first != -1)return ret;
    ret = {0, 0};
    if (!open) {
        auto res = solve(idx + 1, open);
        ret = merge(ret, res);
    }
    if (!open) {
        auto res = solve(idx + 1, 1);
        res.first += -C + vals[idx];
        res.second++;
        ret = merge(res, ret);
    }
    if (open) {
        // close
        auto res = solve(idx, 0);
        ret = merge(res, ret);
        // contine
    }
    if (open) {
        auto res = solve(idx + 1, 1);
        res.first += vals[idx];
        ret = merge(res, ret);
    }
    return ret;
}

signed main() {
    // Go();
    FOCUS
    cin >> n >> k;
    for (int i = 0; i < n; i++)cin >> vals[i];
    double lo = 0, hi = 1e9;
    pair<ld,ld> best;
    int Pen=0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 2; j++) {
            dp[i][j] = {-1, -1};
        }
    }
    C=0;
    while (hi-lo>=1e-8) {
        auto mid = (lo + hi) / 2;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < 2; j++) {
                dp[i][j] = {-1, -1};
            }
        }
        C=mid;
        auto res = solve(0, 0);
        if (res.second > k) {
            lo = mid;
        } else {
            best = res;
            Pen=C;
            hi = mid;
        }
    }
    cout<<best.first+best.second*Pen;


    // open close
    // skip
    // binary search on extra cost to add person
}

Compilation message (stderr)

feast.cpp: In function 'void Go()':
feast.cpp:17:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11
• Subtask 6: 0 / 20
• Subtask 7: 0 / 29