oj.uz

Submission #33943

# Submission time Handle Problem Language Result Execution time Memory
33943 2017-11-05T11:21:26 Z petil Split the sequence (APIO14_sequence) C++14
100 / 100
 1719 ms 85612 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct CHT{
    ll s[100005], t[100005];
    int id[100005];
    int st, ed, sz;
    CHT(){
        st=0, ed=-1, sz=0;
    }
    bool ck(ll L1s, ll L1t, ll L2s, ll L2t, ll mes, ll met){
        ///x1 =   (L1.t-L2.t) /(L2.s-L1.s)
        ///x2 =   (L1.t - me.t) / (me.s-L1.s)
        ///x1<x2
        return (L1t-L2t) * (mes-L1s) < (L1t-met) * (L2s-L1s) ;
    }
    void init(){
        st=0, ed=-1, sz=0;
    }
    void push(ll ss, ll tt, int idx){

        while(sz>=2 && !ck(s[ed-1], t[ed-1], s[ed], t[ed], ss, tt)){
            --ed;--sz;
        }
        if(sz!=0 && s[ed] == ss){
            if(t[ed]>=tt)return;
            s[ed] = ss;t[ed] = tt;id[ed] = idx;
        }
        else{
            ++sz;++ed;
            s[ed] = ss; t[ed] = tt; id[ed] = idx;
        }
    }
    ll val(int ii, ll x)
    {
        return s[ii] * x + t[ii];
    }
    void Efront(ll x)
    {
        while(sz>=2 && !(val(st, x)>val(st+1, x))){
          //  if(que[1].idx == id)return;
            --sz;++st;
        }
    }
    ll maxval(ll x){
        return val(st, x);
    }

}cht;

int n, k, A[100005];
ll s[100005], dp[100005][2];
int pre[100003][202];
void trace(int now, int j)
{
    vector<int> tmp;
    while(1){
        if(j==0)break;
        tmp.push_back(now);
        now = pre[now][j];--j;
    }
    for(int i=(int)tmp.size()-1; i>=0; i--)
        printf("%d ", tmp[i]);
}
int main()
{
    scanf("%d %d", &n, &k);
    for(int i=1; i<=n; i++){
        scanf("%d", &A[i]);
    }
   for(int i=1; i<=n; i++){
        s[i] = s[i-1] + A[i];
   }


    for(int j=1; j<=k; j++){
        cht.init();
        int pos = 0;
        int t = (j&1);
        for(int i=j; i<=n; i++){
         ///    cht.Efront(s[i]);
            cht.push(s[i-1], -s[i-1]*s[n] + dp[i-1][!t], i-1);
            cht.Efront(s[i]);
            dp[i][t] = cht.maxval(s[i]) + s[i]*(s[n]-s[i]);
            pre[i][j] = cht.id[cht.st];
        }

    }
    ll ans=-1, ed=-1;
    for(int i=k; i<=n; i++){
        if(ans<dp[i][k&1]){
            ans = dp[i][k&1];ed=i;
        }
    }

    cout<<ans<<endl;

    trace(ed, k);
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:78:13: warning: unused variable 'pos' [-Wunused-variable]
         int pos = 0;
             ^
sequence.cpp:67:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
                           ^
sequence.cpp:69:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]);
                           ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 85612 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 85612 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 85612 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 85612 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 85612 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 85612 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 85612 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 85612 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 85612 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 85612 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 85612 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 85612 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 85612 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 85612 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 85612 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 85612 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 85612 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 85612 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 85612 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 85612 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 85612 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 85612 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 85612 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 85612 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 85612 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 85612 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 85612 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 85612 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 85612 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 85612 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 85612 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 85612 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 85612 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 85612 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 85612 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 85612 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 85612 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 85612 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 85612 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 3 ms 85612 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 85612 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 3 ms 85612 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 3 ms 85612 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 3 ms 85612 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 0 ms 85612 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 85612 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 85612 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 85612 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 85612 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 66 ms 85612 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 85612 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 43 ms 85612 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 43 ms 85612 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 49 ms 85612 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 43 ms 85612 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 46 ms 85612 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 63 ms 85612 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 85612 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 36 ms 85612 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1686 ms 85612 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 53 ms 85612 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1333 ms 85612 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 953 ms 85612 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1269 ms 85612 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 919 ms 85612 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1719 ms 85612 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1653 ms 85612 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845