oj.uz

답안 #795617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795617 2023-07-27T11:46:44 Z winthemcut3 수열 (APIO14_sequence) C++14
100 / 100
 612 ms 81620 KB 
#include <bits/stdc++.h>
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define fi   first
#define se   second
#define BIT(x, i) (((x) >> (i)) & 1)
using namespace std;

/** END OF TEMPLATE **/

const int mxN = 1e5 + 5;
int n, k;
ll a[mxN];
struct line {
    ll a, b; int id;
    line() = default;
    line(ll a_, ll b_, int id_) : a(a_), b(b_), id(id_) {}
    ll f(ll x) {
        return a*x + b;
    }
};
struct CHTrick {
    deque<line> Y;
    int iter;
    CHTrick() = default;
    bool invalid(const line &l1, const line &l2, const line &l3) {
        return (l3.b - l1.b)*(l1.a - l2.a) <= (l2.b - l1.b)*(l1.a - l3.a);
    }
    void add(line L) {
        while(Y.size() >= 2 && invalid(Y[Y.size()-2], Y.back(), L))
            Y.pop_back();
        Y.push_back(L);
    }
    line getMax(ll x) {
        while(Y.size() >= 2 && Y[0].f(x) <= Y[1].f(x)) {
            Y.pop_front();
        }
        return Y.front();
    }
    void Clear() {
        while(Y.size()) Y.pop_back();
    }
};
ll dp[mxN];
int trace[205][mxN];
int main()
{
    FastIO;
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
    cin >> n >> k;
    FOR(i, 1, n) cin >> a[i], a[i] += a[i-1];
    CHTrick CH;

    CH.iter = 0;
    FOR(i, 1, k) {
        CH.Clear();
        CH.add(line(0, 0, 0));
        FOR(j, 1, n) {
            ll tmp = dp[j];
            line L = CH.getMax(a[j]);
            dp[j] = L.f(a[j]);
            trace[i][j] = L.id;
            CH.add(line(a[j], -a[j]*a[j] + tmp, j));
        }
    }
    cout << dp[n] << '\n';
    int id = trace[k][n];
    while(k--) {
        cout << id << ' ';
        id = trace[k][id];
    }
    return 0;
}

/*
7 3
4 1 3 4 0 2 3
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 340 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 1364 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 340 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 1108 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1256 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 1364 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 596 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 468 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 596 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 340 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 2004 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 328 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 1988 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1832 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 6 ms 2004 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 2004 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 596 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 980 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 724 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 44 ms 9368 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 2 ms 724 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 42 ms 5892 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 50 ms 6672 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 41 ms 7112 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 30 ms 5896 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 40 ms 6656 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 47 ms 8472 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3900 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 14 ms 4168 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 460 ms 81620 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 13 ms 4428 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 612 ms 81096 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 411 ms 57808 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 448 ms 61944 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 317 ms 50884 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 353 ms 57892 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 442 ms 73528 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845