oj.uz

Submission #130141

# Submission time Handle Problem Language Result Execution time Memory
130141 2019-07-14T05:19:55 Z mlyean00 Split the sequence (APIO14_sequence) C++14
0 / 100
 1622 ms 24184 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct line {
    int idx;
    ll a, b;

    line(int idx, ll a, ll b) : idx(idx), a(a), b(b) {}

    ll cost(ll x) const {
        return a * (x - a) + b;
    }

    ll intersect(line const& other) {
        ll lo = other.a;
        ll hi = 1LL << 48;

        while (lo < hi) {
            ll mid = (lo + hi) / 2;
            if (cost(mid) > other.cost(mid)) {
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }

        return lo;
    }
};

int main() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<ll> pref(n + 1, 0);
    partial_sum(a.begin(), a.end(), pref.begin() + 1);

    ll dp[k + 1][n + 1];
    int parent[k + 1][n + 1];

    for (int j = 0; j <= n; ++j) {
        dp[0][j] = 0;
    }
    for (int i = 1; i <= k; ++i) {
        for (int j = 0; j <= n; ++j) {
            dp[i][j] = LLONG_MIN;
        }
    }

    for (int i = 1; i <= k; ++i) {
        deque<line> dq;
        for (int j = 0; j <= n; ++j) {
            while (dq.size() > 1 &&
                   dq[0].cost(pref[j]) <= dq[1].cost(pref[j])) {
                dq.pop_front();
            }
            if (!dq.empty()) {
                dp[i][j] = dq[0].cost(pref[j]);
                parent[i][j] = dq[0].idx;
            }
            line l(j, pref[j], dp[i - 1][j]);

            while (dq.size() > 1) {
                int sz = dq.size();
                ll t1 = dq[sz - 2].intersect(dq[sz - 1]);
                ll t2 = dq[sz - 1].intersect(l);

                if (t1 < t2) break;

                dq.pop_back();
            }
            dq.push_back(l);
        }
    }

    cout << dp[k][n] << endl;

    int u = n;
    for (int i = k; i > 0; --i) {
        u = parent[i][u];
        cout << u << ' ';
    }
    cout << endl;

    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 256 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 256 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 10 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 256 KB contestant found the optimal answer: 900320000 == 900320000
11 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 3598120244 < 3698080248
12 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 256 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 3 ms 376 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Incorrect 2 ms 256 KB contestant didn't find the optimal answer: 69673592483 < 93663683509
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 11 ms 760 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Incorrect 3 ms 376 KB contestant didn't find the optimal answer: 1078788459188 < 1499437552673
5 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Incorrect 126 ms 2724 KB contestant didn't find the optimal answer: 49687892213607 < 49729674225461
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1016 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 23 ms 1052 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 1622 ms 24184 KB contestant didn't find the optimal answer: 4953666672720153 < 4973126687469639
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 225 ms 6392 KB contestant didn't find the optimal answer: 19402457085 < 19795776960
2 Halted 0 ms 0 KB -