oj.uz

Submission #973093

# Submission time Handle Problem Language Result Execution time Memory
973093 2024-05-01T13:40:02 Z oviyan_gandhi Split the sequence (APIO14_sequence) C++17
0 / 100
 780 ms 84964 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int32_t> pii;

#define N 100001
#define K 201
int ps[N];
int32_t 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});
    int ans = 0;
    for (int l = 1; l <= k; l++){
        CHT curr;
        for (int i = 1; i <= n; i++){
            if (ps[i] == ps[i-1]) continue;
            auto [v, j] = prv.query(ps[i]);
            dp[i][l] = j;
            ans = v;
            if (i < n-k+l)
                curr.add({ps[i], v - ps[i]*ps[i], i});
        }
        prv = curr;
    }
    cout << ans << '\n';
    int curr = n;
    for (int i = k; i > 0; i--){
        while (ps[curr] == ps[curr-1]) curr--;
        cout << dp[curr][i] << ' ';
        curr = dp[curr][i];
    }
    cout << '\n';
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 348 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 348 KB contestant found the optimal answer: 0 == 0
4 Incorrect 0 ms 348 KB contestant didn't find the optimal answer: 1541291 < 1542524
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB contestant didn't find the optimal answer: 1064061 < 1093956
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 600 KB contestant didn't find the optimal answer: 514120000 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 2652 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 2648 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 2652 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 6 ms 2652 KB contestant didn't find the optimal answer: 679348358 < 679388326
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9240 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 9052 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 57 ms 9392 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 9308 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Incorrect 44 ms 9292 KB contestant didn't find the optimal answer: 1085402697 < 1085432199
6 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 83764 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 26 ms 83672 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 780 ms 84964 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 27 ms 84656 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Incorrect 711 ms 83760 KB contestant didn't find the optimal answer: 36083804296 < 36183271951
6 Halted 0 ms 0 KB -