oj.uz

Submission #134914

# Submission time Handle Problem Language Result Execution time Memory
134914 2019-07-23T12:11:07 Z fredbr Split the sequence (APIO14_sequence) C++17
50 / 100
 219 ms 3960 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int const maxn = 1010;
int const maxk = 210;
ll const inf = 0x3f3f3f3f3f3f3f3f;

ll p[maxn];
ll dp[maxk][maxn], opt[maxk][maxn];

ll solve(int k, int n) {
    if (dp[k][n] >= 0) return dp[k][n];
    
    if (k == 0) return 0;
    if (n == 1) return -inf;

    ll& d = dp[k][n];
    ll& op = opt[k][n];

    d = -inf, op = 1;

    for (int i = k; i < n; i++) {
        ll cost = p[i] * (p[n]-p[i]) + solve(k-1, i);
        
        if (cost > d) {
            op = i;
            d = cost;
        }
    }

    return d;
}

vector<ll> recover(int k, int n) {
    vector<ll> res;

    while (k != 0) {
        res.push_back(opt[k][n]);
        n = opt[k][n];
        k--;
    }

    reverse(res.begin(), res.end());

    return res;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    memset(dp, -1, sizeof(dp));

    int n, k;
    cin >> n >> k;

    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        p[i] += p[i-1];
    }

    ll ans = solve(k, n);

    auto res = recover(k, n);

    cout << ans << "\n";

    for (ll i : res) cout << i << " ";
    cout << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2044 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 8 ms 2040 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 200 ms 3656 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 7 ms 2040 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 219 ms 3704 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 208 ms 3428 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 184 ms 3704 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 182 ms 3704 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 66 ms 2364 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 125 ms 2808 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 3960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 3832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -