oj.uz

Submission #299174

# Submission time Handle Problem Language Result Execution time Memory
299174 2020-09-14T14:24:53 Z AaronNaidu Split the sequence (APIO14_sequence) C++14
0 / 100
 2000 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[250][250][250];
pair<ll, ll> dpAns[250][250][250];
ll n, k;
ll nums[2000];
ll prefSum[2000];

void explore(int s, int f, int regions, int count) {
    if (regions == 0 or count >= 5)
    {
        return;
    }
    ll split = dpAns[s][f][regions].first;
    ll reg = dpAns[s][f][regions].second;
    //cout << "Exploring " << s << " " << f << " " << regions << "\n";
    //cout << "Answer is " << split << " " << reg << "\n";
    cout << split << " ";
    explore(s, split, reg, count+1);
    explore(split+1, f, regions - reg - 1, count+1);
}

ll getDP(int s, int f, int regions) {
    if (regions == 0)
    {
        return 0;
    }
    if (dp[s][f][regions] >= 0)
    {
        return dp[s][f][regions];
    }
    ll cand = 0;
    for (int i = s; i < f; i++)
    {
        ll thisCand = (prefSum[i] - prefSum[s-1]) * (prefSum[f] - prefSum[i]);
        ll maxLittleCand = 0;
        ll thisLeftRegions = 0;
        for (int j = 0; j <= min(i-s, regions-1); j++)
        {
            ll thisLittleCand = getDP(s, i, j) + getDP(i+1, f, regions-j-1);
            if (maxLittleCand < thisLittleCand)
            {
                maxLittleCand = max(maxLittleCand, thisLittleCand);
                thisLeftRegions = j;
            }
        }
        thisCand += maxLittleCand;
        if (thisCand >= cand)
        {
            cand = max(cand, thisCand);
            dpAns[s][f][regions] = {i, thisLeftRegions};
        }
    }
    return cand;
}

int main() {
    cin >> n >> k;
    cin >> nums[1];
    prefSum[1] = nums[1];
    prefSum[0] = 0;
    for (int i = 1; i < n; i++)
    {
        cin >> nums[i+1];
        prefSum[i+1] = prefSum[i] + nums[i+1];
    }
    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            for (int k = 0; k <= n; k++)
            {
                dp[i][j][k] = -1;
            }
        }
        
    }
    ll ans = getDP(1, n, k);
    cout << ans << "\n";
    explore(1, n, k, 0);
    //cout << "\b\n";
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 640 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 384 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 768 KB contestant found the optimal answer: 1542524 == 1542524
5 Incorrect 4 ms 768 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10496 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 7 ms 10496 KB contestant found the optimal answer: 302460000 == 302460000
3 Execution timed out 2037 ms 6212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 123 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 29.0

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