Submission #351265

# Submission time Handle Problem Language Result Execution time Memory
351265 2021-01-19T18:37:14 Z denkendoemeer Split the sequence (APIO14_sequence) C++14
100 / 100
1317 ms 81888 KB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int v[100005],opt[205][100005];
ll sum[100005],dp[2][100005];
vector<int>ans;
void calc(int st,int dr,int st2,int dr2,int nr,int ind)
{
    if (st>dr)
        return ;
    int mij=(st+dr)/2;
    ll val=-1;
    int poz=1,i;
    for(i=st2;i<=min(mij-1,dr2);i++){
        ll cur=dp[nr^1][i]+(sum[mij]-sum[i])*sum[i];
        if (cur>val)
            val=cur,poz=i;
    }
    opt[ind][mij]=poz;
    dp[nr][mij]=val;
    calc(st,mij-1,st2,poz,nr,ind);
    calc(mij+1,dr,poz,dr2,nr,ind);
}
int main()
{
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int n,k,i;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
        scanf("%d",&v[i]),sum[i]=sum[i-1]+v[i];
    for(i=1;i<=k;i++)
        calc(1,n,1,n,i%2,i);
    printf("%lld\n",dp[k%2][n]);
    int cur=n;
    for(i=k;i>=1;i--)
        ans.push_back(opt[i][cur]),cur=opt[i][cur];
    for(auto it=ans.rbegin();it!=ans.rend();it++)
        printf("%d ",*it);
return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
sequence.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |         scanf("%d",&v[i]),sum[i]=sum[i-1]+v[i];
      |         ~~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 364 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 364 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 364 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
# 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 620 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 1 ms 364 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 492 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 364 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 1388 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 364 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 1132 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1388 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 1388 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 620 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 620 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 364 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 2028 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 364 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 2156 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 1900 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 2156 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 2156 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 748 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1004 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 748 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 67 ms 9580 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 748 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 72 ms 5868 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 70 ms 6764 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 61 ms 7276 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 42 ms 6016 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 64 ms 6764 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 80 ms 8540 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 31 ms 4460 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 30 ms 4460 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 611 ms 81888 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 23 ms 4716 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1317 ms 81568 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 814 ms 58092 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 664 ms 62572 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 465 ms 51308 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 647 ms 58476 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 824 ms 73972 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845