oj.uz

Submission #365057

# Submission time Handle Problem Language Result Execution time Memory
365057 2021-02-10T20:31:18 Z qwerasdfzxcl Split the sequence (APIO14_sequence) C++14
100 / 100
 1004 ms 84220 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int a[100100];
ll s[100100], dp[100100], tmp[100100];
vector<int> fx;
long double ran[100100];
int n, k;
int parent[100100][202];

pair<long double, bool> po(int x1, int x2){
    if (s[x1]==s[x2]) return make_pair(0, 0);
    pair<long double, bool> ret=make_pair(0, 1);
    ll tmp1=s[x2]*s[x2]-s[x1]*s[x1]+tmp[x2]-tmp[x1];
    ll tmp2=s[x2]*2-s[x1]*2;
    ret.first=(long double)tmp1/tmp2;
    return ret;
}

void cht(int t){
    int cur=0;
    dp[0]=1e18;
    for (int i=1;i<n;i++){
        if (i<t){
            dp[i]=1e18;
            continue;
        }
        if (i==t){
            fx.push_back(i-1);
            dp[i]=s[i-1]*(-2)*s[i]+tmp[i-1]+(s[i-1]*s[i-1])+(s[i]*s[i]);
            parent[i][t]=i-1;
            continue;
        }
        pair<long double, bool> tmpp=po(fx.back(), i-1);
        while(tmpp.second && tmpp.first<ran[(int)fx.size()-1]){
            ran[(int)fx.size()-1]=1e20;
            fx.pop_back();
            tmpp=po(fx.back(), i-1);
        }
        if (tmpp.second){
            ran[(int)fx.size()]=tmpp.first;
            fx.push_back(i-1);
        }
        if (cur>=((int)fx.size()-1)){
            cur=(int)fx.size()-1;
        }
        for (;cur<(int)fx.size()-1;cur++){
            if ((long double)s[i]>ran[cur+1]) continue;
            break;
        }
        for (;cur>0;cur--){
            if ((long double)s[i]<ran[cur]) continue;
            break;
        }
        assert(ran[cur]<=(long double)s[i] && (long double)s[i]<=ran[cur+1]);
        //printf("%d %d\n", t, i);
        //for (int j=0;j<=(int)fx.size();j++) printf("%Lf ", ran[j]);
        //printf("\n");
        dp[i]=s[fx[cur]]*(-2)*s[i]+tmp[fx[cur]]+(s[fx[cur]]*s[fx[cur]])+(s[i]*s[i]);
        parent[i][t]=fx[cur];
    }
    for (int i=0;i<n;i++){
        //printf("%lld ", dp[i]);
        tmp[i]=dp[i];
    }
    //printf("\n");
}

int main(){
    scanf("%d %d", &n, &k);
    for (int i=0;i<n;i++) scanf("%d", a+i);
    s[0]=a[0];
    for (int i=1;i<n;i++) s[i]=s[i-1]+a[i];
    for (int i=0;i<n;i++){
        tmp[i]=s[i]*s[i];
    }
    for (int i=0;i<n;i++) parent[i][0]=-1;
    for (int i=1;i<=k;i++){
        fx.clear();
        ran[0]=-1e20;
        fill(ran+1, ran+n+3, 1e20);
        cht(i);
    }
    printf("%lld\n", (s[n-1]*s[n-1]-dp[n-1])/2);
    //printf("%d\n", parent[n-1][k]);
    int idx=k-1;
    for (int i=parent[n-1][k];i!=-1;i=parent[i][idx--]){
        printf("%d ", i+1);
    }
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:71:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:72:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |     for (int i=0;i<n;i++) scanf("%d", a+i);
      |                           ~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8684 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 8812 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 85 ms 8940 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 8812 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 58 ms 8704 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 68 ms 8684 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 75 ms 8812 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 57 ms 8812 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 63 ms 8812 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 78 ms 8880 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 84200 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 66 ms 84200 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 912 ms 84196 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 73 ms 84196 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1004 ms 84200 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 724 ms 84200 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 812 ms 84196 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 637 ms 84220 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 654 ms 84196 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 839 ms 84196 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845