oj.uz

답안 #130145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
130145 2019-07-14T05:25:13 Z mlyean00 수열 (APIO14_sequence) C++14
71 / 100
 710 ms 131076 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct line {
    int idx;
    ll a, b;

    line(int idx, ll a, ll b) : idx(idx), a(a), b(b) {}

    ll cost(ll x) const {
        return a * (x - a) + b;
    }

    ll intersect(line const& other) {
        ll lo = other.a;
        ll hi = 1LL << 32;

        while (lo < hi) {
            ll mid = (lo + hi) / 2;
            if (cost(mid) > other.cost(mid)) {
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }

        return lo;
    }
};

int main() {
    int n, k;
    cin >> n >> k;

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

    vector<ll> pref(n + 1, 0);
    partial_sum(a.begin(), a.end(), pref.begin() + 1);

    ll dp[k + 1][n + 1];
    int parent[k + 1][n + 1];

    for (int i = 0; i <= k; ++i) {
        for (int j = 0; j <= n; ++j) {
            dp[i][j] = 0;
        }
    }

    for (int i = 1; i <= k; ++i) {
        deque<line> dq;
        for (int j = 0; j <= n; ++j) {
            while (dq.size() > 1 &&
                   dq[0].cost(pref[j]) <= dq[1].cost(pref[j])) {
                dq.pop_front();
            }
            if (!dq.empty()) {
                dp[i][j] = dq[0].cost(pref[j]);
                parent[i][j] = dq[0].idx;
            }
            line l(j, pref[j], dp[i - 1][j]);

            while (dq.size() > 1) {
                int sz = dq.size();
                ll t1 = dq[sz - 2].intersect(dq[sz - 1]);
                ll t2 = dq[sz - 1].intersect(l);

                if (t1 < t2) break;

                dq.pop_back();
            }
            dq.push_back(l);
        }
    }

    cout << dp[k][n] << endl;

    int u = n;
    for (int i = k; i > 0; --i) {
        u = parent[i][u];
        cout << u << ' ';
    }
    cout << endl;

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 61 ms 2696 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 64 ms 2808 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 57 ms 2396 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 79 ms 2680 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 58 ms 2708 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 18 ms 760 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 32 ms 1272 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1016 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 18 ms 1052 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 702 ms 24248 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 20 ms 1020 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 433 ms 14868 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 629 ms 17180 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 701 ms 18348 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 486 ms 15172 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 549 ms 17116 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 710 ms 21860 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 6312 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 156 ms 6536 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 161 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -