Submission #257494

#	Time	Username	Problem	Language	Result	Execution time	Memory
257494		karma	Feast (NOI19_feast)	C++14	100 / 100	198 ms	17984 KiB

feast

#include <bits/stdc++.h>
#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
//#define int         int64_t

using namespace std;

const int N = int(6e5) + 7;
typedef pair<ll, int> pii;

pii f[N][2];
int n, k, a[N];

/// 0 - ok
/// 1 - opening

pii operator - (const pii& a, const ll& x) {
    return pii(a.fi - x, a.se + 1);
}
pii operator + (const pii& a, const ll& x) {
    return pii(a.fi + x, a.se);
}
pii max(const pii& x, const pii& y) {
    if(x.fi == y.fi) return x.se < y.se? x: y;
    return x.fi > y.fi? x: y;
}

pii check(ll mid) {
    for(int i = 1; i <= n; ++i) {
        f[i][1] = max(f[i - 1][1], f[i - 1][0]) + a[i];
        f[i][0] = max(f[i - 1][1] - mid, f[i - 1][0]);
    }
    return max(f[n][0], f[n][1] - mid);
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    ll low = 0, mid, high = 1ll * n * (int)1e9;
    n += k;
    while(low <= high) {
        mid = (low + high) >> 1;
        if(check(mid).se > k) low = mid + 1;
        else high = mid - 1;
    }
    cout << check(low).fi + 1ll * low * k;
}

Compilation message (stderr)

feast.cpp: In function 'int32_t main()':
feast.cpp:44:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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