oj.uz

Submission #489390

# Submission time Handle Problem Language Result Execution time Memory
489390 2021-11-22T19:50:38 Z SlavicG Split the sequence (APIO14_sequence) C++17
0 / 100
 228 ms 7848 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
const int N = 1e3 + 10, K = 205;
ll dp[N][K], par[N][K];
ll p[N];
 
ll calc(int l, int r){
    ll ret = p[r];
    if(l)ret -= p[l - 1];
    return ret;
}
void solve()
{ 
    forn(i, N)forn(j, K)dp[i][j] = -1e7, par[i][j] = -1;
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
 
    for(int i = 0;i < n; ++i){
        cin >> a[i];
        p[i] = a[i];
        if(i)p[i] += p[i - 1];
    }
 
    forn(i, n)dp[i][0] = dp[0][i] = 0;
    for(int i = 1; i < n; ++i){
        for(int j = 0; j <= k; ++j){
            dp[i][j] = 0;
            if(j > 0){
                for(int l = 0;l < i; ++l){
                    if(i + 1 < n){
                        if(dp[i][j] < dp[l][j - 1] + calc(l, i - 1) * calc(i, n - 1)){
                            par[i][j] = l;
                        }
 
                        dp[i][j] = max(dp[i][j], dp[l][j - 1] + calc(l, i - 1) * calc(i, n - 1));
                    }
                }
            }
        }
    }
 
    ll mx = 0, idx = 0;
 
    for(int i = 0;i < n; ++i){
        if(dp[i][k] >= mx){
            mx = dp[i][k];
            idx = i;
        }
    }
    cout << mx << "\n";

    int x = idx;
    for(int i = 0;i < k; ++i){
        cout << x << " ";
        x = par[x][k - i];
    }
}   
 
int32_t main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3532 KB contestant didn't find the optimal answer: 1064061 < 1093956
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3532 KB contestant didn't find the optimal answer: 514120000 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3532 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 3532 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 190 ms 3556 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 3532 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 228 ms 3564 KB contestant didn't find the optimal answer: 679348358 < 679388326
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 7116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 7848 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -