oj.uz

Submission #113069

# Submission time Handle Problem Language Result Execution time Memory
113069 2019-05-23T13:47:59 Z dolphingarlic Split the sequence (APIO14_sequence) C++14
0 / 100
 18 ms 7816 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
typedef long long ll;
using namespace std;

ll n, k;
pair<ll, ll> dp[201][100001];
ll pref[100001];

bool case1(ll k, ll l, ll j, ll i) {
    return (dp[i][k].first - dp[i][l].first >
            (pref[k] - pref[l]) * (pref[n] - pref[j]));
}

bool case2(ll k, ll l, ll j, ll i) {
    return ((dp[i][l].first - dp[i][k].first) * (pref[j] - pref[k]) <
            (dp[i][j].first - dp[i][k].first) * (pref[k] - pref[l]));
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    FOR(i, 1, n + 1) {
        ll x;
        cin >> x;
        pref[i] = pref[i - 1] + x;
    }

    fill(dp[0], dp[0] + n + 1, make_pair(0, 0));
    FOR(i, 1, k + 1) {
        deque<ll> q;
        q.push_back(0);
        dp[i][0] = {0, 0};
        FOR(j, 1, n + 1) {
            while (q.size() > 1 && case1(q[1], q[0], j, i - 1)) q.pop_front();

            ll x = q[0];
            dp[i][j] = {dp[i - 1][x].first + (pref[j] - pref[x]) * (pref[n] - pref[j]), x};

            while (q.size() > 1 && case2(q[q.size() - 2], q[q.size() - 1], j, i - 1)) q.pop_back();
            q.push_back(j);
        }
    }

    ll mx = 0, indx;
    FOR(i, 1, n + 1) {
        if (dp[k][i].first > mx) mx = dp[k][i].first, indx = i;
    }
    cout << mx << '\n';
    FOR(i, 0, k) {
        cout << indx << ' ';
        indx = dp[k - i][indx].second;
    }
    cout << '\n';
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 384 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 304 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 384 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 384 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 384 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 384 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 384 KB contestant found the optimal answer: 1 == 1
9 Incorrect 2 ms 384 KB Integer 0 violates the range [1, 9]
10 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB contestant didn't find the optimal answer: 1092256 < 1093956
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB contestant didn't find the optimal answer: 407161746 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 512 KB contestant didn't find the optimal answer: 20166072 < 21503404
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1152 KB contestant didn't find the optimal answer: 1197227828 < 1818678304
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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