Submission #489393

# Submission time Handle Problem Language Result Execution time Memory
489393 2021-11-22T19:54:28 Z SlavicG Split the sequence (APIO14_sequence) C++17
39 / 100
314 ms 8608 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] = -1e15, par[i][j] = -1;
    int n, k;
    cin >> n >> k;
    vector<ll> a(n);
    for(int i = 0;i < n; ++i){
        cin >> a[i];
        p[i] = a[i];
        if(i)p[i] += p[i - 1];
    }
    if(n == 0){
        cout << 0;
        return;
    }
    forn(i, n)dp[i][0] = 0;
    forn(j, k + 1)dp[0][j] = 0;
    for(int i = 1; i < n; ++i){
        for(int j = 1; j <= k; ++j){
            dp[i][j] = 0;
            for(int l = 0;l < i; ++l){
                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();
    }
}
# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 3532 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 3532 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 3532 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 3532 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 3532 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 3532 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 3532 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 3532 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 3532 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 3532 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 3532 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 3532 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 3532 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 3532 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 3532 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3532 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 3532 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 3532 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 3460 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 3532 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 3532 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 3532 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 3532 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 3532 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 3532 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3532 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 3532 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 7 ms 3660 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 3532 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 8 ms 3532 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 10 ms 3552 KB Integer 0 violates the range [1, 199]
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 3532 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 3564 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 140 ms 3548 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 3532 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 314 ms 3544 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 241 ms 3532 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 129 ms 3548 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 135 ms 3548 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 41 ms 3532 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 91 ms 3564 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 7116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 8608 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -