Submission #595997

# Submission time Handle Problem Language Result Execution time Memory
595997 2022-07-14T09:00:58 Z shrimb Split the sequence (APIO14_sequence) C++17
100 / 100
1568 ms 82136 KB
#include"bits/stdc++.h"
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;

#define int long long
#define endl '\n'
#define mod 1000000007
//\
#define mod 1686876991

const int maxn = 100011;
int n, k;

int a[maxn];
int p[maxn];

vector<int> dpa(maxn), dpb(maxn);
signed opts[202][maxn];

#define cost(l,r) ((p[r] - (l ? p[l - 1] : 0)) * (p[n-1] - p[r]))

void rec (int l, int r, int lk, int rk, int j) {
    if (r < l) return;
    int m = (l + r) / 2;
    int opt = lk;
    dpb[m] = -1;

    for (int K = lk ; K <= rk ; K++) {
        if ((K ? dpa[K - 1] : 0) + cost(K, m) > dpb[m]) {
            opt = K;
            dpb[m] = (K ? dpa[K - 1] : 0) + cost(K, m);
        }
    }
    opts[j][m] = opt;
    rec(l, m - 1, lk, opt, j);
    rec(m + 1, r, opt, rk, j);
}

signed main () {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;

    for (int i = 0 ; i < n ; i++) {
        cin >> a[i];
        p[i] = a[i];
        if (i) p[i] += p[i-1];
    }

    for (int i = 0 ; i < n ; i++) {
        dpa[i] = cost(0, i);
    }
    for (int i = 2 ; i <= k + 1 ; i++) {
        rec(i - 1, n - (k - i) - 2, i - 1, n - (k - i) - 2, i);
        swap(dpa, dpb);
    }
    cout << dpa[n-1] << endl;
    int i = k + 1;
    int j = n - 1;
    vector<int> v;
    while (i > 1) {
        v.push_back(opts[i][j]);
        j = opts[i][j] - 1;
        i--;
    }
    reverse(v.begin(), v.end());
    for (int i : v) cout << i << " ";
}

Compilation message

sequence.cpp:14:1: warning: multi-line comment [-Wcomment]
   14 | //\
      | ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 1924 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 1856 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 1928 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 1876 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 1924 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 1876 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 1876 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 1876 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 1876 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 1876 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 1876 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 1928 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 1924 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 1876 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 1876 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 1920 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 1876 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 2052 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 1920 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 1876 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 1928 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 2004 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 1876 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 1876 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 1876 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 1876 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2816 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 1876 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 2516 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 2684 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 2772 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2132 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 2004 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 2180 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1920 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 3412 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1876 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 11 ms 3412 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 3236 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 3412 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 8 ms 3460 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 2204 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 2516 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2132 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 2196 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 73 ms 10640 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 2260 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 83 ms 7172 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 81 ms 8124 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 78 ms 8592 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 84 ms 7408 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 79 ms 8052 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 103 ms 9832 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 29 ms 4812 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 23 ms 4812 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 823 ms 82136 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 5052 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1568 ms 81876 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 935 ms 58360 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 899 ms 62648 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 665 ms 51500 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 851 ms 58668 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1078 ms 74172 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845