oj.uz

Submission #997442

# Submission time Handle Problem Language Result Execution time Memory
997442 2024-06-12T10:26:38 Z vjudge1 Split the sequence (APIO14_sequence) C++17
50 / 100
 2000 ms 32716 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll N = 1e4 + 100;
const ll K = 205;

ll n, k, a[N], dp[N][K], par[N][K], suff[N];

int main(){
    cin >> n >> k;
    k++;

    for (ll i = 1; i <= n; i ++)
        cin >> a[i];
    for (ll i = n; i > 0; i --)
        suff[i] = suff[i + 1] + a[i];

    for (ll i = n; i > 0; i --){
        for (ll p = 2; p <= k; p ++){
            if (i + p - 1 > n){
                dp[i][p] = -1e18;
                continue;
            }
            dp[i][p] = -1;
            for (int j = n; j > i; j --){
                ll val = dp[j][p - 1] + (suff[i] - suff[j]) * suff[j];
                if (dp[i][p] < val){
                    dp[i][p] = val;
                    par[i][p] = j;
                }
            }            
        }
    }

    cout << dp[1][k] << endl;

    ll cur_i = 1;
    ll cur_k = k;

    while (cur_k > 1){
        cout << par[cur_i][cur_k] - 1 << " ";
        cur_i = par[cur_i][cur_k];
        cur_k--;
    }
    cout << endl;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 2496 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 2396 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 2396 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 2396 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 2396 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 2396 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 2396 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 2396 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 2392 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 2396 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 2396 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 2396 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 2396 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 2396 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 2396 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 2396 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 6492 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 4 ms 6492 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 6492 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 6492 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 6492 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 5 ms 6492 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 6744 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 6492 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 6744 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 6616 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 103 ms 6680 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 6488 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 107 ms 6480 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 91 ms 6480 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 103 ms 6484 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 105 ms 6484 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 22 ms 6616 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 48 ms 6480 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 32716 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 214 ms 32596 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2041 ms 16300 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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