oj.uz

Submission #960852

# Submission time Handle Problem Language Result Execution time Memory
960852 2024-04-11T06:31:06 Z vjudge1 Split the sequence (APIO14_sequence) C++17
0 / 100
 778 ms 81744 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int lead[100100][200],zero[100100];
ll pre[100100],val[100100];
struct Ln{
    ll k,b,ii;
    Ln(){k=b=0;}
    Ln(ll a,ll x,ll i){k=a,b=x,ii=i;}
    ll inter(Ln x){
        return (b-x.b)/(x.k-k);
    }
    ll val(int x){
        return k*x+b;
    }
};
deque<Ln>ch;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>pre[i];
        if(!pre[i])
            n--,zero[i--]++;
        else
            pre[i]+=pre[i-1],
            zero[i]+=zero[i-1];
    }
    if(k>=n-1){
        ll v=0;
        for(int i=1;i<n;i++)
            v+=((pre[n]-pre[i])*(pre[i]-pre[i-1]));
        cout<<v<<'\n';
        for(int i=1;i<n;i++)
            cout<<i+zero[i]<<' ';
        return 0;
    }
    for(int i=1;i<=k;i++){
        ch.push_back(Ln(pre[i],val[i]-pre[i]*pre[i],i));
        for(int j=i+1;j<=n;j++){
            while(ch.size()>1&&ch[0].inter(ch[1])<pre[j])
                ch.pop_front();
            ll V=ch[0].val(pre[j]);
            lead[j][i]=ch[0].ii;
            Ln L(pre[j],val[j]-pre[j]*pre[j],j);
            while(ch.size()>1&&L.inter(ch[ch.size()-2])<=ch.back().inter(ch[ch.size()-2]))
                ch.pop_back(); ch.push_back(L);
            val[j]=V;
        }
        ch.clear();
    }
    cout<<val[n]<<'\n';
    stack<int>stk;
    int cnt=k+1;
    while(--cnt)
        stk.push(n=lead[n][cnt]);
    while(stk.size())
        cout<<stk.top()+zero[stk.top()]<<' ',stk.pop();
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:47:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   47 |             while(ch.size()>1&&L.inter(ch[ch.size()-2])<=ch.back().inter(ch[ch.size()-2]))
      |             ^~~~~
sequence.cpp:48:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   48 |                 ch.pop_back(); ch.push_back(L);
      |                                ^~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 2396 KB contestant found the optimal answer: 999 == 999
3 Incorrect 1 ms 2396 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 2396 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 2396 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 2396 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 1 ms 2396 KB contestant didn't find the optimal answer: 1005304675 < 1005304678
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2392 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 2396 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2396 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Incorrect 1 ms 2396 KB contestant didn't find the optimal answer: 1019625818 < 1019625819
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 4444 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 4440 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 4444 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 6 ms 4444 KB contestant didn't find the optimal answer: 679388313 < 679388326
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8796 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 8792 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 71 ms 10844 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 10844 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Incorrect 39 ms 8796 KB contestant didn't find the optimal answer: 1085432196 < 1085432199
6 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 67144 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 22 ms 67420 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 778 ms 81744 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 33 ms 81692 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Incorrect 705 ms 67420 KB contestant didn't find the optimal answer: 36183271946 < 36183271951
6 Halted 0 ms 0 KB -