oj.uz

Submission #208058

# Submission time Handle Problem Language Result Execution time Memory
208058 2020-03-09T21:49:44 Z rzbt Split the sequence (APIO14_sequence) C++14
100 / 100
 1136 ms 87800 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 100005
#define MAXK 205
typedef long long ll;


using namespace std;

ll n,u;
ll dp[MAXN][2];
ll niz[MAXN];
ll suma[MAXN];
int sec[MAXN][MAXK];
pair<ll,ll> prava[MAXN];
vector<pair<pair<ll,ll>,ll> > prave;

int main()
{
    prave.reserve(MAXN);
    scanf("%lld %lld", &n, &u);

    for(ll i=1;i<=n;i++)
        scanf("%lld",niz+i);
    for(ll i=1;i<=n;i++)
        suma[i]=suma[i-1]+niz[i];


    for(ll k=1;k<=u;k++){
        prave.clear();
        for(int i=1;i<=n;i++)dp[i][0]=dp[i][1];
        for(ll d=k+1;d<=n;d++){
            pair<ll,ll> t=mp(suma[d-1],-suma[d-1]*suma[d-1]+dp[d-1][0]);
            prava[d-1]=t;
            while(!prave.empty()){
                pair<ll,ll> posl=prava[prave.back().S];
                if(posl.F==t.F){
                    prave.pop_back();
                    continue;
                }
                ll presek=(posl.S-t.S)/(t.F-posl.F)+((posl.S-t.S)%(posl.F-t.F)==0?0:1);
                if(presek>10000000000000000ll)exit(2);
                if(presek<=prave.back().F.F){
                    prave.pop_back();
                    continue;
                }
                prave.back().F.S=presek-1;
                prave.pb(mp(mp(presek,10000000000000000ll),d-1));
                break;
            }
            if(prave.empty()){
                prave.pb(mp(mp(0ll,10000000000000000ll),d-1));
            }
            ll l=0,r=prave.size()-1,sol=-1;
            while(l<=r){
                ll mid=(l+r)/2;
                if(prave[mid].F.F<=suma[d]){
                    sol=prave[mid].S;
                    l=mid+1;
                }else
                    r=mid-1;

            }
            dp[d][1]=prava[sol].F*suma[d]+prava[sol].S;
            sec[d][k]=sol;

            /**
            dp[d][k]=-1;
            for(ll i=k+1;i<=d;i++){
                ll tr=suma[i-1]*(suma[d]-suma[i-1])+dp[i-1][k-1];
                if(tr>dp[d][k]){
                    sec[d][k]=i-1;
                    dp[d][k]=tr;
                }

            }
            */
            //printf("   %lld %lld    %lld\n",d,k,dp[d][k]);
            /*for(auto x:prave){
                printf("     %lld %lld      %lld %lld\n",x.F.F,x.F.S,prava[x.S][k-1].F,prava[x.S][k-1].S);
            }
            printf("\n");*/
        }
    }

    printf("%lld\n",dp[n][1]);
    ll poc=n;
    for(ll i=u;i>0;i--){
        poc=sec[poc][i];
        printf("%lld ",poc);
    }
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &n, &u);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",niz+i);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8952 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 11 ms 9080 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 84 ms 9120 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 10 ms 9080 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 64 ms 8952 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 85 ms 9080 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 79 ms 9080 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 73 ms 9080 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 68 ms 9080 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 83 ms 9080 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 87160 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 72 ms 87160 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1022 ms 87656 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 71 ms 87544 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1136 ms 87288 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 981 ms 87288 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 882 ms 87800 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 799 ms 87672 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 803 ms 87416 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1031 ms 87416 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845