Submission #660341

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
660341	2022-11-21T17:02:31 Z	leroycut	Split the sequence (APIO14_sequence)	C++17	33 / 100	2000 ms	3680 KB

sequence

#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ld = long double;
 
const int N = 1e5 + 3;
const ll INF = 2e12 + 3;

int n, k;
ll dp[N][203], p[N];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    cin >> n >> k;
    for(int i = 1; i <= n; ++i){
        ll a;
        cin >> a;
        p[i] = p[i - 1] + a;
    }

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j < i; ++j){
            for(int t = 1; t < i; ++t){
                dp[i][j] = max(dp[i][j], dp[t][j - 1] + p[t] * (p[i] - p[t]));
            }
        }
    }

    ll cur = dp[n][k];
    cout << cur << "\n";
    int poi = n - 1, end = n, cnt = k - 1;
    for(; poi >= 1 && cnt >= 0; --poi){
        if(dp[poi][cnt] + p[poi] * (p[end] - p[poi]) == dp[end][cnt + 1]){
            cout << poi << " ";
            end = poi;
            cnt--;
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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