답안 #973088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973088 2024-05-01T13:36:44 Z oviyan_gandhi 수열 (APIO14_sequence) C++17
89 / 100
749 ms 84784 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)
                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;
}
# 결과 실행 시간 메모리 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 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 348 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 1 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 1 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 348 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 0 ms 348 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 348 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 348 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 348 KB contestant found the optimal answer: 999919994 == 999919994
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 348 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 1 ms 344 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 348 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 600 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 348 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 348 KB contestant found the optimal answer: 29000419931 == 29000419931
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 604 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 604 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 604 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 604 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 2 ms 604 KB position 199 occurs twice in split scheme
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 2860 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 2652 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 2652 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 2652 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 5 ms 2652 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 7 ms 2652 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 2748 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 2652 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 2648 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 71 ms 9396 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 9304 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 37 ms 9288 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 40 ms 9052 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 57 ms 9304 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 39 ms 9408 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 47 ms 9360 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 55 ms 9308 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 83768 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 26 ms 83616 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 679 ms 84784 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 29 ms 84556 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 749 ms 83936 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 478 ms 83036 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 570 ms 84572 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 470 ms 84728 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 487 ms 84412 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 622 ms 84312 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845