oj.uz

Submission #34098

# Submission time Handle Problem Language Result Execution time Memory
34098 2017-11-07T09:30:03 Z wan2000 Split the sequence (APIO14_sequence) C++14
100 / 100
 609 ms 88468 KB 
#include <bits/stdc++.h>

#define mp make_pair
#define X first
#define Y second

using namespace std;

template<typename T> inline void read(T &x){
    x = 0; char ch; while(!isdigit(ch=getchar()));
    do{ x = 10*x+ch-'0'; } while(isdigit(ch=getchar()));
}

typedef long long ll;
typedef pair<ll,ll> pll;

const int N = 100001;
const int K = 201;

int n, k, Tr[K][N], pnt, s;
ll A[N], S[N], F[2][N], res;
vector<pair<pll,int> > L, D;

bool maxi(ll &x, ll y){
    if(x<y) x = y;
    else return 0;
    return 1;
}

void BackTrack(int x, int d){
    if(d==0) return;
    cout<<x<<' ';
    BackTrack(Tr[d][x],d-1);
}

bool bad(pll a, pll b, pll c){
    return (c.Y-a.Y)*(a.X-b.X)>=(b.Y-a.Y)*(a.X-c.X);
}

void add(pair<pll,int> p){
    while(L.size()>=2&&bad(L[L.size()-2].X,L.back().X,p.X)){
        L.pop_back();
    }
    L.push_back(p);
}

ll get(ll x, int d, int u){
    if(pnt>=(int)L.size()) pnt = L.size()-1;
    while(pnt<(int)L.size()-1&&L[pnt+1].X.X*x+L[pnt+1].X.Y>L[pnt].X.X*x+L[pnt].X.Y){
        pnt++;
    }
    Tr[d][u] = L[pnt].Y;
    return L[pnt].X.X*x+L[pnt].X.Y;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    read(n); read(k);
    for(int i = 1; i <= n; i++){
        read(A[i]);
        S[i] = S[i-1]+A[i];
    }
    for(int ii = 1; ii <= k; ii++){
        pnt = 0;
        L.clear();
        for(int i = n-ii; i >= 1; i--){
            add(mp(mp(S[i+1],F[(ii+1)%2][i+1]),i+1));
            F[ii%2][i] = get(S[i],ii,i)-S[i]*S[i];
        }
    }
    res = -1;
    for(int i = 1; i <= n-1; i++){
        if(maxi(res,F[k%2][i])){
            s = i;
        }
    }
    cout<<res<<'\n';
    BackTrack(s,k);
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

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

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 88468 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 16 ms 88468 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 476 ms 88468 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 9 ms 88468 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 609 ms 88468 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 376 ms 88468 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 419 ms 88468 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 336 ms 88468 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 333 ms 88468 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 463 ms 88468 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845