oj.uz

Submission #154854

# Submission time Handle Problem Language Result Execution time Memory
154854 2019-09-25T11:30:31 Z srvlt Split the sequence (APIO14_sequence) C++14
50 / 100
 2000 ms 5732 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"
#define int long long
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 <int, int> pii;
const int N = 1e5 + 3, K = 203;
int n, k, a[N], dp[K][N], p[N], last[K][N];

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

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

void upd(int x, int y, int pos) {
    line tmp;
    tmp.k = x, tmp.b = y;
    while (h.size() > 1 && tmp.del(h[h.size() - 1], h[h.size() - 2])) {
        h.ppb();
        ind.ppb();
    }
    h.pb(tmp);
    ind.pb(pos);
}

pii getmax(int x) {
    if (h.empty()) {
        return {0, 0};
    }
//    int l = 0, r = h.size() - 1;
//    while (l < r) {
//        int mid = (l + r) / 2;
//        if (h[mid].val(x) < h[mid + 1].val(x)) {
//            l = mid + 1;
//        }   else {
//            r = mid;
//        }
//    }
//    return {h[l].val(x), ind[l]};
    int mx = -1;
    for (int i = 0; i < h.size(); i++) {
        if (mx == -1 || h[i].val(x) > h[mx].val(x)) {
            mx = i;
        }
    }
    return {h[mx].val(x), ind[mx]};
}

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 = {};
        ind = {};
        for (int j = 1; j < i; j++) {
            if (i > 1) {
                upd(-p[j], dp[i - 1][j], j);
            }
        }
        for (int j = i; j < n; j++) {
            int x = p[n] - p[j];
            pii z = getmax(x);
            dp[i][j] = p[j] * x + z.fi;
            last[i][j] = z.se;
            if (i > 1) {
                upd(-p[j], dp[i - 1][j], j);
            }
        }
    }
    int res = -1;
    for (int i = 1; i < n; i++) {
        if (res == -1 || dp[k][res] < dp[k][i]) {
            res = i;
        }
    }
    getans(k, res);
    cout << dp[k][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();
    }
}

Compilation message

sequence.cpp: In function 'pii getmax(long long int)':
sequence.cpp:78:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < h.size(); i++) {
                     ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 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 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 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 376 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 376 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 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 3 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 428 KB contestant found the optimal answer: 140072 == 140072
14 Correct 3 ms 400 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 392 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 380 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 3 ms 888 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 504 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 632 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 504 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 504 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 504 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 348 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 12 ms 2912 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 10 ms 2168 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 12 ms 2680 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 12 ms 2808 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 5 ms 1016 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 4 ms 760 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 6 ms 1144 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 6 ms 504 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 289 ms 5368 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 504 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 290 ms 5416 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 248 ms 4668 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 297 ms 5496 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 297 ms 5496 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 61 ms 1528 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 139 ms 2424 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 1500 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 293 ms 1656 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2039 ms 3692 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2021 ms 5732 KB Time limit exceeded
2 Halted 0 ms 0 KB -