oj.uz

Submission #1076405

# Submission time Handle Problem Language Result Execution time Memory
1076405 2024-08-26T13:38:32 Z YassirSalama Split the sequence (APIO14_sequence) C++17
28 / 100
 158 ms 3600 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define F first
#define S second
template<typename T> 
void dbg(const T& t){
    cout<<t<<endl;
}
template<typename T,typename... Args>
void dbg(const T& t,const Args&... args){
    cout<<t<<" , ";
    dbg(args...);
}
#define dbg(...) cout<<"("<<#__VA_ARGS__<<") : ";dbg(__VA_ARGS__);
const int maxn=1000+10;
int n,k;
int pref[maxn];
int v[maxn];
int sum(int l,int r){
    if(l>r) return 0LL;
    if(l==0) return pref[r];
    return pref[r]-pref[l-1];
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    for(int i=1;i<=n;i++){
        pref[i]=v[i];
        if(i) pref[i]+=pref[i-1];
    }
    int dp[n+1][k+1];
    for(int i=0;i<=n;i++) for(int j=0;j<=k;j++) dp[i][j]=-1e18;
    dp[0][0]=0;
    int ans=0;
    int cost[n+1][k+1];
    memset(cost,0,sizeof(cost));
    for(int i=1;i<=n;i++){
        for(int j=i;j>=1;j--){
            for(int t=k;t>=1;t--){
                int x=dp[j-1][t-1]+sum(j,i)*sum(i+1,n);
                if(dp[i][t]<x){
                    dp[i][t]=x;
                    cost[i][t]=sum(j,i)*sum(i+1,n);
                    ans=max(ans,dp[i][t]);
                }
            }
        }
    }
    cout<<ans<<"\n";
    vector<int> a;
    int t=k;
    for(int i=n;i>=1;i--){
        if(dp[i][t]==ans){
            a.pb(i);
            ans-=cost[i][t];
            t--;
        }
    }
    reverse(all(a));
    for(auto x:a){
        cout<<x<<" ";
    }
    cout<<"\n";
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 348 KB contestant found the optimal answer: 999 == 999
3 Incorrect 0 ms 348 KB Integer 2 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 348 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 348 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 344 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 348 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 348 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 348 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 348 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 5 ms 860 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 348 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 7 ms 860 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 10 ms 1024 KB Integer 200 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 348 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 145 ms 3416 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 348 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 158 ms 3596 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 96 ms 2908 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 156 ms 3600 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 106 ms 3416 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 23 ms 856 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 53 ms 1716 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB declared answer doesn't correspond to the split scheme: declared = 26, real = 628910
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -