oj.uz

Submission #154923

# Submission time Handle Problem Language Result Execution time Memory
154923 2019-09-25T13:16:49 Z srvlt Split the sequence (APIO14_sequence) C++14
100 / 100
 1309 ms 84700 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse2,avx")
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
using namespace std;

void dout() {
    cerr << endl;
}

template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <ll, int> pii;
const int N = 1e5 + 3, K = 203;
const ll inf = 1e18;
int n, k, a[N], p[N], last[K][N];
ll dp[2][N];

struct line {
    int k = 0;
    ll b = 0;
    line(int k, ll b) {
        this -> k = k;
        this -> b = b;
    }
    ll val(int x) {
        return (ll)k * x + b;
    }
    db intrsc(const line & l) {
        return (db)(l.b - b) / (db)(k - l.k);
    }
    bool del(line & l1, line & l2) {
        if (k == l1.k) {
            return b >= l1.b;
        }
        return intrsc(l2) < l1.intrsc(l2);
    }
};

vector <line> h;
vector <int> ind, ans;
vector <ll> pnt;

void upd(int x, ll y, int pos) {
    line tmp = line(x, y);
    while (h.size() > 1 && tmp.del(h[h.size() - 1], h[h.size() - 2])) {
        h.ppb();
        pnt.ppb();
        ind.ppb();
    }
    if (h.size() > 0) {
        pnt.pb((int)(tmp.intrsc(h.back())));
    }
    h.pb(tmp);
    ind.pb(pos);
}

pii getmax(int x) {
    if (h.empty()) {
        return {0, 0};
    }
    int tmp = upper_bound(pnt.begin(), pnt.end(), x) - pnt.begin() - 1;
    return {h[tmp].val(x), ind[tmp]};
}

void getans(int x, int y) {
    if (!y) {
        return;
    }
    ans.pb(y);
    getans(x - 1, last[x][y]);
}

void solve(int tc) {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        p[i] = p[i - 1] + a[i];
    }
    for (int i = 1; i <= k; i++) {
        h = {}, pnt = {-inf}, ind = {};
        for (int j = 1; j < i; j++) {
            dp[i & 1][j] = 0;
        }
        for (int j = 1; j < i; j++) {
            if (i > 1) {
                upd(p[j], dp[(i - 1) & 1][j], j);
            }
        }
        for (int j = i; j < n; j++) {
            int x = p[n] - p[j];
            pii z = getmax(-x);
            dp[i & 1][j] = (ll)p[j] * x + z.fi;
            last[i][j] = z.se;
            if (i > 1) {
                upd(p[j], dp[(i - 1) & 1][j], j);
            }
        }
    }
    int res = -1;
    for (int i = 1; i < n; i++) {
        if (res == -1 || dp[k & 1][res] < dp[k & 1][i]) {
            res = i;
        }
    }
    getans(k, res);
    cout << dp[k & 1][res] << endl;
    reverse(ans.begin(), ans.end());
    for (auto i : ans) {
        cout << i << " ";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 380 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 348 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 424 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 380 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 296 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 504 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 388 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 504 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 632 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 380 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 376 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 504 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 424 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 4 ms 1528 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 388 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 1144 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 1284 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 4 ms 1400 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 688 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 3 ms 504 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 676 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 380 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 11 ms 2168 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 404 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 13 ms 2040 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 12 ms 1912 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 13 ms 2072 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 12 ms 2040 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 760 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 6 ms 1128 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1144 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 1144 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 98 ms 9780 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 1236 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 76 ms 6232 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 99 ms 7144 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 96 ms 7600 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 85 ms 6352 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 78 ms 7088 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 100 ms 8836 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 6828 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 29 ms 6836 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1049 ms 84700 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 30 ms 7704 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1309 ms 83932 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1116 ms 60356 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 997 ms 65360 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 936 ms 54152 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 806 ms 60880 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1050 ms 76536 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845