oj.uz

Submission #731224

# Submission time Handle Problem Language Result Execution time Memory
731224 2023-04-27T07:38:41 Z Alihan_8 Split the sequence (APIO14_sequence) C++17
50 / 100
 178 ms 10196 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
#define int long long

bool chmin(int &x, int y){
    bool flag = false;
    if ( x > y ){
        x = y; flag |= true;
    }
    return flag;
}

bool chmax(int &x, int y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}

const int N = 1e3 + 1, inf = 1e15 + 1;

int dp[N][202], par[N][202];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    vector <int> p(n), pref(n + 1);
    for ( auto &i: p ) cin >> i;
    for ( int i = 0; i < n; i++ ){
        pref[i + 1] = pref[i] + p[i];
    }
    for ( int i = 0; i < N; i++ ){
        for ( int j = 0; j <= 200; j++ ){
            dp[i][j] = -inf;
        }
    }
    dp[0][0] = 0; ++k;
    for ( int i = 1; i <= n; i++ ){
        for ( int j = 1; j <= k; j++ ){
            for ( int l = 0; l < i; l++ ){
                int v = (pref[i] - pref[l]) * pref[l];
                if ( chmax(dp[i][j], dp[l][j - 1] + v) ){
                    par[i][j] = l;
                }
            }
        }
    }
    cout << dp[n][k] << ln;
    vector <int> res;
    int it = n;
    while ( k > 0 ){
        it = par[it][k--];
        if ( it ) res.pb(it);
    }
    reverse(all(res));
    for ( auto i: res ){
        cout << i << ' ';
    }

    cout << '\n';
}

/*
7 3
4 1 3 4 0 2 3
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 1876 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 1876 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 1992 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 1992 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 1876 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 1988 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 1876 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 1876 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 1876 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3396 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 3400 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 150 ms 3396 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 8 ms 3404 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 178 ms 3388 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 157 ms 3412 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 135 ms 3500 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 136 ms 3484 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 59 ms 3428 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 83 ms 3472 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 7156 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 17 ms 10196 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -