Submission #299293

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
299293	2020-09-14T16:27:46 Z	AaronNaidu	Split the sequence (APIO14_sequence)	C++14	11 / 100	2000 ms	131080 KB

sequence

#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) {
    if (regions == 0)
    {
        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);
    explore(split+1, f, regions - reg - 1);
}

ll getDP(int s, int f, int regions) {
    if (regions > f-s)
    {
        return -1000000000000;
    }
    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 = -1;
        ll thisLeftRegions = 0;
        ll thisLittleCand = getDP(s, i, 0) + getDP(i+1, f, regions-1);
        if (maxLittleCand < thisLittleCand)
        {
            maxLittleCand = max(maxLittleCand, thisLittleCand);
            thisLeftRegions = 0;
        }
        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";
    //cout << "Exploring\n";
    explore(1, n, k);
    //cout << "\b\n";
}

Subtask #1
11.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	640 KB	contestant found the optimal answer: 1542524 == 1542524
5	Correct	1 ms	640 KB	contestant found the optimal answer: 4500000000 == 4500000000
6	Correct	1 ms	640 KB	contestant found the optimal answer: 1 == 1
7	Correct	1 ms	640 KB	contestant found the optimal answer: 1 == 1
8	Correct	1 ms	640 KB	contestant found the optimal answer: 1 == 1
9	Correct	1 ms	768 KB	contestant found the optimal answer: 100400096 == 100400096
10	Correct	1 ms	640 KB	contestant found the optimal answer: 900320000 == 900320000
11	Correct	1 ms	640 KB	contestant found the optimal answer: 3698080248 == 3698080248
12	Correct	1 ms	640 KB	contestant found the optimal answer: 3200320000 == 3200320000
13	Correct	1 ms	640 KB	contestant found the optimal answer: 140072 == 140072
14	Correct	1 ms	512 KB	contestant found the optimal answer: 376041456 == 376041456
15	Correct	1 ms	768 KB	contestant found the optimal answer: 805 == 805
16	Correct	1 ms	640 KB	contestant found the optimal answer: 900189994 == 900189994
17	Correct	1 ms	640 KB	contestant found the optimal answer: 999919994 == 999919994

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	5888 KB	contestant found the optimal answer: 1093956 == 1093956
2	Correct	4 ms	6016 KB	contestant found the optimal answer: 302460000 == 302460000
3	Correct	5 ms	5888 KB	contestant found the optimal answer: 122453454361 == 122453454361
4	Correct	4 ms	5888 KB	contestant found the optimal answer: 93663683509 == 93663683509
5	Execution timed out	2064 ms	6008 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	81272 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	64 ms	81320 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	48 ms	81400 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Correct	70 ms	81272 KB	contestant found the optimal answer: 1499437552673 == 1499437552673
5	Execution timed out	2044 ms	80632 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-