oj.uz

Submission #138218

# Submission time Handle Problem Language Result Execution time Memory
138218 2019-07-29T15:39:44 Z Runtime_error_ Split the sequence (APIO14_sequence) C++14
71 / 100
 497 ms 131076 KB 
//APIO 2014 Split the sequence
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e5+9,K=209,MX=1e9+9;
ll n,k,ans=-MX,idx;
ll pre[inf],a[inf];
pair<ll,ll> dp[K][inf];
vector<ll> split;


struct line {
    ll m, c,idx;
    ll eval(ll x) { return m * x + c; }
    #define ld long double
    ld intersectX(line l) {
        if(l.m == m)
            return MX;
        assert(l.m != m);
         return (ld) (c - l.c) / (l.m - m);
         }
};

struct LineContainer{
    //for maximum
    // m increasing and x increasing
    //to get m is decreasing x is decreasing -m , -x

    deque<line> dq;
    #define last dq.size()-1

    void add(ll m,ll p,ll idx){
        line cur = {m,p,idx};
        while (dq.size() >= 2 && dq[last-1].intersectX(cur) <= dq[last-1].intersectX(dq[last]))
            dq.pop_back();
        dq.push_back(cur);
    }

    pair<ll,ll> query(ll x){
        while (dq.size() >= 2 && dq[0].eval(x) <= dq[1].eval(x))
            dq.pop_front();
        assert(!dq.empty());
        return make_pair(dq[0].eval(x),dq[0].idx);
    }
};

int main(){

    cin>>n>>k;
    for(ll i=1;i<=n;i++)
        cin>>a[i],pre[i]=pre[i-1]+a[i];

    for(ll j=1;j<=k;j++){
        LineContainer lc;
        lc.add(pre[j-1],dp[j-1][j-1].first - pre[j-1]*pre[n],j-1);
        for(ll i=j;i<=n;i++){
            dp[j][i] = lc.query(pre[i]);
            dp[j][i].first += pre[i]*pre[n] - pre[i]*pre[i] ;
            lc.add(pre[i],dp[j-1][i].first-pre[i]*pre[n],i);
        }
    }

    for(ll i=1;i<=n;i++)
        if(ans<dp[k][i].first)
            ans=dp[k][i].first,idx=i;

    split.push_back(idx);
    for(ll j=k;j>1;j--)
        idx=dp[j][idx].second,split.push_back(idx);

    reverse(split.begin(),split.end());

    cout<<ans<<endl;
    for(auto o:split)
        cout<<o<<" ";
    cout<<endl;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 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 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 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 376 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 376 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 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 3 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 632 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 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 504 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 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

# Verdict Execution time Memory 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 4 ms 2040 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 6 ms 352 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 1528 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 1912 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 4 ms 2040 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 760 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 632 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 888 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 504 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 12 ms 4604 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 13 ms 4600 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 12 ms 3960 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 15 ms 4600 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 13 ms 4600 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 5 ms 1272 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 2040 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1144 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 1076 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 112 ms 32952 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 1144 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 85 ms 20112 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 94 ms 23472 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 97 ms 24956 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 76 ms 20348 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 89 ms 23340 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 112 ms 29680 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 7204 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 46 ms 7380 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 497 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -