oj.uz

Submission #973017

# Submission time Handle Problem Language Result Execution time Memory
973017 2024-05-01T12:27:37 Z oviyan_gandhi Split the sequence (APIO14_sequence) C++17
38 / 100
 68 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;

#define N 100001
#define K 201
int ps[N];
pii dp[N][K];

struct Frac {
    int n, d;
    Frac(int num, int den) : n{num}, d{den} { if (d < 0) n = -n, d = -d; }
    bool operator < (const Frac &o) const { return __int128_t(n)*__int128_t(o.d) < __int128_t(o.n)*__int128_t(d); }
};

struct Line {
    int m, c, i;
    Frac isect(const Line &o) const { return {c - o.c, o.m - m}; }
    int operator () (const int x) const { return m*x + c; }
};

struct CHT {
    deque<Line> hull;

    void add(Line l){
        while (hull.size() >= 2 && hull[1].isect(l) < hull[1].isect(hull[0]))
            hull.pop_front();
        hull.push_front(l);
    }

    pii query(int x){
        while (hull.size() >= 2 && hull.back()(x) <= hull[hull.size()-2](x))
            hull.pop_back();
        return {hull.back()(x), hull.back().i};
    }
};

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k; cin >> n >> k;
    for (int i = 1; i <= n; i++){
        cin >> ps[i];
        ps[i] += ps[i-1];
    }
    ps[0] = -1;
    CHT prv;
    for (int i = 1; i <= n; i++)
        if (ps[i] != ps[i-1])
            prv.add({ps[i], -ps[i]*ps[i], i});
    for (int l = 1; l <= k; l++){
        CHT curr;
        for (int i = 1; i <= n; i++){
            if (ps[i] == ps[i-1]) continue;
            dp[i][l] = prv.query(ps[i]);
            curr.add({ps[i], dp[i][l].first - ps[i]*ps[i], i});
        }
        prv = curr;
    }
    cout << dp[n][k].first << '\n';
    int curr = n;
    for (int i = k; i > 0; i--){
        while (ps[curr] == ps[curr-1]) curr--;
        cout << dp[curr][i].second << ' ';
        curr = dp[curr][i].second;
    }
    cout << '\n';
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Integer 2 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB contestant found the optimal answer: 1093956 == 1093956
2 Incorrect 1 ms 348 KB declared answer doesn't correspond to the split scheme: declared = 0, real = 302460000
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2648 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2652 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2652 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 2652 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 1 ms 2652 KB Integer 200 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 4700 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 4700 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 4696 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 4700 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 4956 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 9 ms 4700 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 4700 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 4700 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 4696 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 33884 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 33788 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 68 ms 34020 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 33884 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 41 ms 33888 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 54 ms 33812 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 57 ms 33880 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 43 ms 33884 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 49 ms 33884 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 59 ms 33884 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 58 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -