oj.uz

Submission #394789

# Submission time Handle Problem Language Result Execution time Memory
394789 2021-04-27T10:15:02 Z Anand Split the sequence (APIO14_sequence) C++14
100 / 100
 515 ms 81704 KB 
#include <stdio.h>
int q[100010],p[210][100010];
long long a[100010],D[100010],E[100010];
void path(int k,int n){
    if(k<0)return;
    path(k-1,p[k][n]);
    printf("%d ",n);
}
int main(){
    int i,j,n,k,f,r;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;++i)scanf("%lld",a+i),a[i]+=a[i-1],D[i]=-a[i]*a[i];
    for(i=1;i<=k;++i){
        q[f=r=1]=i;
        for(j=i+1;j<=n;++j){
            while(f<r&&a[q[f]]*a[j]+D[q[f]]<=a[q[f+1]]*a[j]+D[q[f+1]])++f;
            E[j]=a[q[f]]*a[j]+D[q[f]]-a[j]*a[j],p[i][j]=q[f];
            while(f<r&&(D[q[r]]-D[q[r-1]])*(a[q[r-1]]-a[j])>=(D[j]-D[q[r-1]])*(a[q[r-1]]-a[q[r]]))--r;
            q[++r]=j;
        }
        for(j=i+1;j<=n;++j)D[j]=E[j];
    }
    printf("%lld\n",D[n]+a[n]*a[n]);
    path(k-1,p[k][n]);
    return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 204 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 1316 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 288 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 1100 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 1228 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 1356 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 544 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 460 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 588 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 332 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 2044 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 336 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 5 ms 1996 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 6 ms 1740 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 5 ms 2000 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 1996 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 1 ms 588 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 2 ms 972 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 684 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 32 ms 9228 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 2 ms 716 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 33 ms 5692 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 31 ms 6604 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 42 ms 7108 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 23 ms 5836 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 28 ms 6680 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 36 ms 8388 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4032 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 19 ms 4304 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 300 ms 81704 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 18 ms 4676 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 515 ms 81340 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 324 ms 57956 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 358 ms 62172 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 258 ms 51100 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 257 ms 58128 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 330 ms 73708 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845