oj.uz

답안 #403926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403926 2021-05-13T15:12:33 Z opukittpceno_hhr 수열 (APIO14_sequence) C++17
100 / 100
 914 ms 86968 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>

using namespace std;

typedef long long ll;

const ll INF = 1e18 + 239;
const int N = 1e5 + 7;
const int K = 203;

ll dp[N];
ll ndp[N];

int wr[K][N];

int a[N];
ll ps[N];

vector<int> out;

void rec(int k, int n) {
    if (k == 0) return;
    rec(k - 1, wr[k][n]);
    out.push_back(n - wr[k][n]);
}

namespace CHT {
    typedef long double ld;

    struct Line {
        ll k, b;
        ld start;
        int id;

        Line(ll k_, ll b_, ld start_, int id_) {
            k = k_;
            b = b_;
            start = start_;
            id = id_;
        }

        ld eval_ld(ld x) {
            return k * x + b;
        }
    };

    int pnt = 0;
    vector<Line> st;

    void init() {
        pnt = 0;
        st.clear();
    }

    void add(ll k, ll b, int id) {
        Line cur(k, b, -1, id);
        while (!st.empty()) {
            Line bc = st.back();
            if (cur.eval_ld(bc.start) < bc.eval_ld(bc.start)) {
                st.pop_back();
            } else {
                break;
            }
        }
        if (st.empty()) {
            cur.start = 0;
            st.push_back(cur);
        } else {
            if (st.back().k == cur.k) return;
            ld start = (st.back().b - cur.b) / (cur.k - st.back().k);
            cur.start = start;
            st.push_back(cur);
        }
    }

    ll get(ll x) {
        if (st.empty()) return -1;
        pnt = min(pnt, (int)st.size() - 1);
        while (pnt + 1 < (int)st.size() && st[pnt + 1].start < x) {
            pnt++;
        }
        return st[pnt].id;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k;
    cin >> n >> k;
    k++;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        ps[i + 1] = ps[i] + a[i];
    }
    fill(dp, dp + N, INF);
    dp[0] = 0;
    for (int i = 1; i <= k; i++) {
        ndp[0] = INF;
        CHT::init();
        for (int j = 1; j <= n; j++) {
            ndp[j] = INF;
            int add = j - 1;
            if (dp[add] != INF) {
                CHT::add(-ps[add], dp[add] + ps[add] * ps[add], add);
            }
            int p = CHT::get(2 * ps[j]);
            if (p != -1) {
                ndp[j] = dp[p] + ps[p] * ps[p] - 2 * ps[p] * ps[j] + ps[j] * ps[j];
                wr[i][j] = p;
            }
        }
        for (int j = 0; j <= n; j++) {
            dp[j] = ndp[j];
        }
    }
    cout << (ps[n] * ps[n] - dp[n]) / 2 << endl;
    rec(k, n);
    {
        int c = 0;
        for (int i = 0; i + 1 < k; i++) {
            c += out[i];
            cout << c << ' ';
        }
        cout << endl;
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1100 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 1100 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 1100 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 1100 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 1100 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 1100 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 1100 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 1100 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 1100 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 1100 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 1100 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 1100 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 1100 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 1100 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 1100 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 1100 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 1100 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 1100 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 1356 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 1100 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 1100 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 1100 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 1228 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 1100 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 1100 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 1100 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 1100 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 2124 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 1100 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 1868 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1996 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 2124 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 1356 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 1228 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 1356 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1228 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1228 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 11 ms 2820 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 1228 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 11 ms 2764 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 2636 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 2892 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 9 ms 2828 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1484 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 1868 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1992 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 1992 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 90 ms 10612 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 2248 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 60 ms 7052 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 63 ms 7916 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 71 ms 8384 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 57 ms 7228 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 61 ms 7872 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 77 ms 9724 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 10044 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 27 ms 10044 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 901 ms 86968 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 30 ms 10440 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 914 ms 85844 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 629 ms 62248 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 762 ms 67496 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 592 ms 56280 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 620 ms 62948 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 843 ms 78500 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845