Submission #13778

# Submission time Handle Problem Language Result Execution time Memory
13778 2015-04-01T09:15:38 Z comet Split the sequence (APIO14_sequence) C++
100 / 100
1161 ms 85484 KB
#include<cstdio>
#include<algorithm>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pp;
ll d[2][100010],s[100010],N,K;
int r[201][100001];
void f(int x,int y){
    if(x==1)return;
    f(x-1,r[x][y]);
    printf("%d ",(int)r[x][y]);
}
struct convex{
    deque<ll> a,b;
   deque<int>c;
    void init(){a.clear();b.clear();c.clear();}
    void push(ll n,ll m,int v){
        while(a.size()>1&&(b[b.size()-2]-b.back())*(n-a.back())>=(b.back()-m)*(a.back()-a[a.size()-2])){
            a.pop_back();
            b.pop_back();
            c.pop_back();
        }
        a.push_back(n);
        b.push_back(m);
        c.push_back(v);
    }
    pp query(ll x){
        while(!a.empty()&&(a[1]-a[0])*x>(b[0]-b[1])){
            a.pop_front();
            b.pop_front();
            c.pop_front();
        }
        return pp(a[0]*x+b[0],c[0]);
    }
};
int main(){
    scanf("%lld%lld",&N,&K);
    if(K==0)K++;
    for(int i=1;i<=N;i++){
        scanf("%lld",&s[i]);
        s[i]+=s[i-1];
    }
    convex* pre=new convex;
    convex* cur=new convex;
    pp ret;
    for(int i=1;i<=N;i++){
        d[1][i]=s[i]*(s[N]-s[i]);
        pre->push(s[i],d[1][i]-s[i]*s[N],i);
    }
    for(int g=2;g<=K+1;g++){
        for(int i=g;i<=N;i++){
            ret=pre->query(s[i]);
            d[g&1][i]=ret.first+(s[N]-s[i])*s[i];
            r[g][i]=ret.second;
            cur->push(s[i],d[g&1][i]-s[i]*s[N],i);
        }
        pre->init();
        swap(cur,pre);
    }
    printf("%lld\n",d[(K+1)&1][N]);
    f(K+1,N);
    delete cur,pre;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 8 ms 82440 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 12 ms 82440 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 11 ms 82440 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 82440 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 7 ms 82440 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 16 ms 82440 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 82440 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 82440 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 4 ms 82568 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 82700 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 89 ms 82704 KB Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 82704 KB Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 75 ms 82700 KB Output is correct - contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 84 ms 82568 KB Output is correct - contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 78 ms 82704 KB Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 69 ms 82704 KB Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 73 ms 82704 KB Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 90 ms 82700 KB Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 34 ms 84804 KB Output is correct - contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 34 ms 84928 KB Output is correct - contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 906 ms 85476 KB Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 23 ms 85476 KB Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1161 ms 85048 KB Output is correct - contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 816 ms 84540 KB Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 819 ms 85480 KB Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 670 ms 85484 KB Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 704 ms 85208 KB Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 889 ms 85200 KB Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845