oj.uz

Submission #1088345

# Submission time Handle Problem Language Result Execution time Memory
1088345 2024-09-14T09:24:51 Z rlx0090 Split the sequence (APIO14_sequence) C++14
33 / 100
 2000 ms 32084 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;
int cache[200][100005];
long long p[100005], dp[2][100005];
long long minf = numeric_limits<long long>::min();
struct seg {
    long long k = 0, b = minf;
    int label = -1;
    seg() {}
    seg(long long _k, long long _b, int _label) :k(_k), b(_b), label(_label) {}
    long long f(long long x) {
        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;
    }
};

void add(Node* cur, seg ns, int nl, int nr) {
    if(cur->s.b == minf && ns.b == minf) return;
    int m = (nl + nr) / 2;
    bool lef = cur->s.f(nl) < ns.f(nl);
    bool mid = cur->s.f(m) < ns.f(m);
    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);
    }
}

seg query(Node* cur, int x, int nl, int nr) {
    if(nl == nr) return cur->s;
    int m = (nl + nr) / 2;
    if(x <= m){
        if(cur->left == nullptr) return cur->s;
        seg c = query(cur->left, x, nl, m);
        if(cur->s.f(x) < c.f(x)) return c;
        return cur->s;
    }
    else {
        if(cur->right == nullptr) return cur->s;
        seg c = query(cur->right, x, m + 1, nr);
        if(cur->s.f(x) < c.f(x)) return c;
        return cur->s;
    }
}
 
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;
    int before, cur;
    for(int k = 1; k <= K; ++k) {
        before = k % 2; cur = (k + 1) % 2;
        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[before][i + 1], i), 0, 1e9);
            seg c = query(tree, p[i], 0, 1e9);
            dp[cur][i] = c.f(p[i]) - p[N] * p[i];
            cache[k][i] = c.label + 1;
        }
        delete(tree);
    }
    cout << dp[cur][0] << '\n';
    int s = 0;
    // for(int k = 1; k <= K; ++k) {
    //     for(int i = 0; i <= N - k - 1; ++i)
    //         cout << cache[k][i] << ' ';
    //     cout << endl;
    // }
    for(int k = K; k >= 1; --k) {
        cout << cache[k][s] << ' ';
        s = cache[k][s];
    }
 
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:93:22: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |     cout << dp[cur][0] << '\n';
      |                      ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 348 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 356 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 348 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 348 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 344 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 348 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 348 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 348 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 344 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 344 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 348 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 344 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 8 ms 1372 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 600 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 10 ms 1116 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 9 ms 1300 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 7 ms 1372 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 604 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 604 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 604 KB contestant found the optimal answer: 490686959791 == 490686959791

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 3 ms 600 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 58 ms 2128 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 348 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Runtime error 98 ms 4036 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 18 ms 1372 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Runtime error 678 ms 19976 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 8532 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 167 ms 9552 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2057 ms 32084 KB Time limit exceeded
4 Halted 0 ms 0 KB -