oj.uz

답안 #366984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366984 2021-02-15T22:35:06 Z rocks03 수열 (APIO14_sequence) C++14
100 / 100
 960 ms 88684 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXK = 200+10;
const int MAXN = 2e5+100;
int N, K, a[MAXN], opt[MAXN][MAXK];
ll pr[MAXN], dp[MAXN], dp2[MAXN];

struct line{
    ll m, q, i;
};

ll eval(line a, ll x){
    return (a.m * x + a.q);
}

bool pback(line a, line b, line c){
    return (a.q - b.q) * (c.m - b.m) <= (b.q - c.q) * (b.m - a.m);
}

void solve(){
    cin >> N >> K;
    rep(i, 1, N + 1){
        cin >> a[i];
        pr[i] = pr[i - 1] + a[i];
    }
    rep(k, 1, K + 1){
        deque<line> q;
        q.push_back({0, 0, 0});
        rep(i, 1, N + 1){
            while(SZ(q) > 1 && eval(q[0], pr[i]) <= eval(q[1], pr[i])){
                q.pop_front();
            }
            int j = q[0].i;
            dp2[i] = dp[j] + (pr[i] - pr[j]) * (pr[N] - pr[i]);
            opt[i][k] = j;
            line cur = {pr[i], dp[i] - pr[i] * pr[N], i};
            while(SZ(q) > 1 && pback(cur, q.back(), q[SZ(q) - 2])){
                q.pop_back();
            }
            q.push_back(cur);
        }
        swap(dp, dp2);
    }
    ll ans = -1; int ind = 0;
    per(i, N - 1, 1){
        if(dp[i] > ans){
            ans = dp[i], ind = i;
        }
    }
    cout << ans << "\n";
    per(k, K, 1){
        cout << ind << " ";
        ind = opt[ind][k];
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3692 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 3 ms 3692 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 48 ms 3712 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 3 ms 3692 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 34 ms 3692 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 44 ms 3692 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 49 ms 3716 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 13 ms 3692 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 12 ms 3820 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 15 ms 3692 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4332 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 4332 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 54 ms 4332 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 4332 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 54 ms 4332 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 48 ms 4460 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 57 ms 4460 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 53 ms 4332 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 14 ms 4332 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 24 ms 4332 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11884 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 10 ms 12012 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 120 ms 12132 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 9 ms 11884 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 83 ms 12012 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 93 ms 11884 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 98 ms 11884 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 76 ms 11884 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 92 ms 11884 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 113 ms 11884 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 87788 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 63 ms 88172 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 779 ms 88684 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 64 ms 88556 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 960 ms 88300 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 662 ms 88044 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 687 ms 88556 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 547 ms 88428 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 624 ms 88300 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 782 ms 88300 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845