oj.uz

Submission #1110894

# Submission time Handle Problem Language Result Execution time Memory
1110894 2024-11-10T23:13:17 Z DylanSmith Feast (NOI19_feast) C++17
18 / 100
 88 ms 1616 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define lb(x,y) lower_bound(all(x),y)-begin(x)

mt19937 rng;

pair<ll, int> check(vector<int> &a, ll cost) {
    pair<ll, int> n = {0, 0}, y = {LLONG_MIN, 0};
    for (int i = 0; i < sz(a); i++) {
        pair<ll, int> n2 = n;
        if (y.first != LLONG_MIN) n2 = max(n2, y);
        pair<ll, int> y2 = {n.first + a[i] - cost, n.second + 1};
        if (y.first != LLONG_MIN) {
            y2 = max(y2, {y.first + a[i], y.second});
            y2 = max(y2, {y.first + a[i] - cost, y.second + 1});
        }
        swap(n, n2);
        swap(y, y2);
    }
    return max(n, y);
}

ll search(vector<int> &a, int K, ll l, ll r) {
    if (l > r) return LLONG_MIN;
    ll mid = (l + r) / 2;
    auto p = check(a, mid);
    if (p.second >= K) {
        ll m = search(a, K, mid + 1, r);
        if (m != LLONG_MIN) return m;
        return p.first + K * mid;
    }
    return search(a, K, l, mid - 1);
}

void solve() {
    int N, K; cin >> N >> K;
    vector<int> a(N);
    for (int i = 0; i < a.size(); i++) cin >> a[i];
    ll res = search(a, K, 1, LLONG_MAX / 2);
    if (res == LLONG_MIN) cout << "0\n";
    else cout << res << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    rng = mt19937(chrono::steady_clock::now().time_since_epoch().count());

    solve();

    return 0;
}

Compilation message

feast.cpp: In function 'void solve()':
feast.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < a.size(); i++) cin >> a[i];
      |                     ~~^~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 1360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1360 KB Output is correct
2 Correct 51 ms 1616 KB Output is correct
3 Correct 50 ms 1360 KB Output is correct
4 Incorrect 63 ms 1360 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1616 KB Output is correct
2 Correct 78 ms 1360 KB Output is correct
3 Correct 80 ms 1616 KB Output is correct
4 Correct 77 ms 1360 KB Output is correct
5 Correct 80 ms 1616 KB Output is correct
6 Correct 88 ms 1616 KB Output is correct
7 Correct 85 ms 1616 KB Output is correct
8 Correct 85 ms 1616 KB Output is correct
9 Correct 79 ms 1616 KB Output is correct
10 Correct 82 ms 1616 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 1360 KB Output isn't correct
2 Halted 0 ms 0 KB -