oj.uz

Submission #1013131

# Submission time Handle Problem Language Result Execution time Memory
1013131 2024-07-03T08:16:53 Z Luvidi Split the sequence (APIO14_sequence) C++17
0 / 100
 73 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n,k;
    cin>>n>>k;
    k++;
    ll a[n+1],pre[n+1];
    pre[0]=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        pre[i]=pre[i-1]+a[i];
    }

    ll dp[n+1][k+1],prev[n+1][k+1];
    memset(dp,0,sizeof(dp));
    for(int i=0;i<=n;i++){
        for(int j=i+1;j<=k;j++)dp[i][j]=-1e18;
        if(i)dp[i][0]=-1e18;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            int y=lower_bound(pre+1,pre+n+1,pre[i]-pre[i]/j)-pre;
            for(int x=0-2;x<3;x++){
                int p=max(1,min(y+x,i));
                dp[i][j]=max(dp[i][j],pre[p-1]*(pre[i]-pre[p-1])+dp[p-1][j-1]);
                if(dp[i][j]==pre[p-1]*(pre[i]-pre[p-1])+dp[p-1][j-1])prev[i][j]=p-1;
            }
        }
    }
    cout<<dp[n][k]<<'\n';
    vector<int> ans;
    int c=n,x=k;
    while(c){
        ans.pb(c);
        c=prev[c][x];
        x--;
    }
    reverse(ans.begin(),ans.end());
    ans.pop_back();
    for(int i:ans)cout<<i<<' ';
}

int main() {   
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 348 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Incorrect 1 ms 344 KB contestant didn't find the optimal answer: 1542523 < 1542524
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 348 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 348 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 348 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 348 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 860 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 348 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Incorrect 1 ms 860 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Incorrect 0 ms 348 KB contestant didn't find the optimal answer: 139441971 < 140412195
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1372 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Incorrect 2 ms 1372 KB contestant didn't find the optimal answer: 1326260187 < 1326260195
3 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 9820 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 23 ms 10020 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 73 ms 131072 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -