oj.uz

Submission #1088281

# Submission time Handle Problem Language Result Execution time Memory
1088281 2024-09-14T07:50:24 Z rlx0090 Split the sequence (APIO14_sequence) C++14
0 / 100
 2000 ms 95800 KB 
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <string.h>
#include <stack>
#include <limits>

using namespace std;
int N, K;
long long p[100005], dp[201][100005];
long long minf = numeric_limits<long long>::min();
struct seg {
    long long k = 0, b = minf;
    seg() {}
    seg(long long _k, long long _b) :k(_k), b(_b) {}
    long long f(long long x) {
        //cout << "k : " << k << " x : " << x << " b : " << b << endl;
        return k * x + b;
    }
};
struct Node {
    Node * left = nullptr;
    Node * right = nullptr;
    seg s;
    ~Node() {
        if(left != nullptr) delete left;
        if(right != nullptr) delete right;
    }
};
// max value
void add(Node* cur, seg ns, long long nl, long long nr) {
    if(cur->s.b == minf && ns.b == minf) return;
    
    long long m = (nl + nr) / 2;
    bool lef = cur->s.f(nl) < ns.f(nl);
    bool mid = cur->s.f(m) < ns.f(m);
    //cout << "cur : " << cur->s.f(m) << " ns : " << ns.f(m) << " result : " << (cur->s.f(m) < ns.f(m)) <<  endl;
    if(mid) swap(cur->s, ns);
    if(nl == nr) return;
    else if(lef != mid) {
        if(cur->left == nullptr) cur->left = new Node();
        add(cur->left, ns, nl, m);
    }
    else {
        if(cur->right == nullptr) cur->right = new Node();
        add(cur->right, ns, m + 1, nr);
    }
}

long long query(Node* cur, long long x, long long nl, long long nr) {
    if(nl == nr) {return cur->s.f(nl);}
    long long m = (nl + nr) / 2;
    if(x <= m) {
        if(cur->left == nullptr) {return cur->s.f(x);}
        return max(cur->s.f(x), query(cur->left, x, nl, m));
    } else {
        if(cur->right == nullptr) {return cur->s.f(x);}
        return max(cur->s.f(x), query(cur->right, x, m + 1, nr));
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> N >> K;
    long long q;
    for(int i = 1; i <= N; ++i) {
        cin >> q;
        p[i] = p[i - 1] + q;
    }
    Node * tree;
    long long ans = 0;
    for(int k = 1; k <= K; ++k) {
        tree = new Node();
        for(int i = N - k - 1;  i >= 0; --i){
            add(tree, seg(p[i + 1], - p[i + 1] * p[i + 1] + p[N] * p[i + 1] + dp[k - 1][i + 1]), 0, 1000 * N);
            dp[k][i] = query(tree, p[i], 0, 1000 * N) - p[N] * p[i];
            ans = max(ans, dp[k][i]);
        }
        delete(tree);
    }
    cout << ans << endl;
    int s = 0;
    for(int k = K; k >= 1; --k) {
        for(int i = s + 1; i <= N - k - 1; ++i) {
            if(ans - ( (p[N] - p[i]) * (p[i] - p[s]) ) == dp[k - 1][i] ) {
                cout << i << " ";
                ans -= (p[N] - p[i]) * (p[i] - p[s]);
                s = i;
                break;
            }
        }
    }

    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 348 KB contestant found the optimal answer: 999 == 999
3 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 348 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 22 ms 2944 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Incorrect 1 ms 348 KB contestant didn't find the optimal answer: 35054919674099 < 37485571387523
5 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 1492 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 292 ms 17040 KB contestant didn't find the optimal answer: 4654924548445890 < 4973126687469639
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 8016 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 75 ms 9300 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2080 ms 95800 KB Time limit exceeded
4 Halted 0 ms 0 KB -