oj.uz

답안 #238054

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
238054 2020-06-09T20:22:59 Z DS007 수열 (APIO14_sequence) C++14
100 / 100
 797 ms 84712 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define evaluate(pt, x) (pt.first.first * x + pt.first.second)

const int N = 1e5, K = 201;
int a[N], p[K], n, k, last[N][K];
ll s[N], dp[N], dp_prev[N];
vector<pair<pair<ll, ll>, int>> hull;

ll find(int i, int j, ll x) {
    for (; p[j] < (int)hull.size() - 1; p[j]++) {
        if (evaluate(hull[p[j]], x) > evaluate(hull[p[j] + 1], x))
            break;
    }
    last[i][j + 1] = hull[p[j]].second;
    return evaluate(hull[p[j]], x);
}

bool inter(pair<ll, ll> a, pair<ll, ll> b, pair<ll, ll> c) {
    return (a.second - b.second) * (c.first - a.first) > (a.second - c.second) * (b.first - a.first);
}

void insert(int j, pair<pair<ll, ll>, int> nl) {
    while (hull.size() > 1) {
        auto temp = hull.back();
        hull.pop_back();

        if (inter(nl.first, temp.first, hull.back().first)) {
            hull.push_back(temp);
            break;
        }

        p[j] = min(p[j], (int)hull.size() - 1);
    }
    hull.push_back(nl);
}

int solveTestCase() {
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];

    s[0] = a[0];
    for (int i = 1; i < n; i++) s[i] = s[i - 1] + a[i];

    /*for (int i = 1; i < n; i++) {
        for (int j = 1; j <= k && j <= i; j++) {
            dp[i][j] = find(i, j - 1, s[i]);
            insert(j - 1, {{s[i], dp[i][j - 1] - s[i] * s[i]}, i});
        }
        insert(min(i, k), {{s[i], dp[i][min(i, k)] - s[i] * s[i]}, i});
    }*/

    for (int j = 1; j <= k; j++) {
        insert(j - 1, {{s[j - 1], dp_prev[j - 1] - s[j - 1] * s[j - 1]}, j - 1});
        for (int i = j; i < n; i++) {
            dp[i] = find(i, j - 1, s[i]);
            insert(j - 1, {{s[i], dp_prev[i] - s[i] * s[i]}, i});
            dp_prev[i] = dp[i];
        }
        hull.clear();
    }

    cout << dp[n - 1] << "\n";
    for (int i = last[n - 1][k], j = k; j > 0; --j, i = last[i][j]) cout << i + 1 << " ";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    // cin >> test;
    while (test--)
        solveTestCase();
}

Compilation message

sequence.cpp: In function 'int solveTestCase()':
sequence.cpp:66:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1280 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 1152 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 1280 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 6 ms 1280 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 11 ms 1408 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1280 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 1280 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 9 ms 1280 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 6 ms 1152 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 1280 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8896 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 8768 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 55 ms 8828 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 10 ms 8828 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 45 ms 8768 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 49 ms 8768 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 51 ms 8828 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 38 ms 8956 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 44 ms 8828 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 55 ms 8828 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 83816 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 57 ms 83812 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 638 ms 84712 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 55 ms 84712 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 797 ms 83944 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 496 ms 83944 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 558 ms 84712 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 407 ms 84588 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 464 ms 84324 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 580 ms 84328 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845