Submission #329496

# Submission time Handle Problem Language Result Execution time Memory
329496 2020-11-21T10:38:55 Z denverjin Split the sequence (APIO14_sequence) C++14
100 / 100
739 ms 85464 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define mp make_pair
#define pb push_back

#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)

struct func {
    int k; ll b;
    func(): k(), b() {}
    func(int k, ll b): k(k), b(b) {}
    ll get(int x) { return 1LL * k * x + b; }
    double inter(func o) {
        return -(double)(b - o.b) / (k - o.k);
    }
};

int n, k, a[100005], s[100005];
ll dp[100005], ndp[100005];
int pr[100005][205];
func f[100005];
int que[100005], ql, qr;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> k;
    rep(i, n) cin >> a[i], s[i + 1] = s[i] + a[i];
    rep(j, k) {
        ql = qr = 0;
        rep(i, n) {
            f[i] = func(s[i], dp[i] - 1LL * s[i] * s[i]);
            while (qr - ql >= 2 && f[que[qr - 2]].inter(f[i]) <= f[que[qr - 2]].inter(f[que[qr - 1]])) -- qr;
            que[qr ++] = i;
            while (qr - ql >= 2 && f[que[ql]].get(s[i + 1]) <= f[que[ql + 1]].get(s[i + 1])) ++ ql;
            ndp[i + 1] = f[que[ql]].get(s[i + 1]);
            pr[i + 1][j + 1] = que[ql];
        }
        memcpy(dp, ndp, sizeof(dp));
    }
    cout << dp[n] << endl;
    vector <int> ans;
    int i = n, j = k;
    while (j) i = pr[i][j], -- j, ans.pb(i);
    reverse(ans.begin(), ans.end());
    rep(i, ans.size()) cout << ans[i] << " ";
    cout << endl;
    return 0;
}

/*
7 3
4 1 3 4 0 2 3

*/
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 2668 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 2668 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 2668 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 2668 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 2668 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 2668 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 2668 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 2668 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 2668 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 2668 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 2668 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 2668 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 2668 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 2668 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 2668 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 3 ms 2668 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2796 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 2796 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 4 ms 2796 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 3 ms 2796 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 2796 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 2796 KB contestant found the optimal answer: 933702 == 933702
7 Correct 3 ms 2796 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 2796 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 2796 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 3 ms 2796 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2924 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 2924 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 9 ms 2924 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 2924 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 7 ms 2924 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 9 ms 2924 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 9 ms 2924 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 4 ms 2924 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 4 ms 2924 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 2924 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 3 ms 3584 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 3564 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 14 ms 3564 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 3564 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 14 ms 3564 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 13 ms 3564 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 14 ms 3564 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 13 ms 3564 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 5 ms 3564 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 3564 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 8 ms 10860 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 10988 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 62 ms 10988 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 10988 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 48 ms 10860 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 53 ms 10860 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 52 ms 10988 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 41 ms 10988 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 50 ms 10988 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 61 ms 10988 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 60 ms 84972 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 56 ms 84972 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 636 ms 85464 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 59 ms 85356 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 739 ms 85100 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 523 ms 84972 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 572 ms 85356 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 441 ms 85228 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 487 ms 85356 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 616 ms 85228 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845