Submission #537555

# Submission time Handle Problem Language Result Execution time Memory
537555 2022-03-15T08:28:12 Z Leonardo_Paes Split the sequence (APIO14_sequence) C++17
100 / 100
1529 ms 86128 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
#define f first
#define s second 
const int maxn = 1e5+10, maxk = 210;
 
ll dp[maxn][2], v[maxn], suf[maxn];
int opt[maxn][maxk];
 
void solve(int l, int r, int optl, int optr, int k){
	if(l > r) return;
	int mid = (l + r) >> 1;
	dp[mid][1] = 0;
	for(int i=optl; i<=min(mid-1, optr); i++){
		ll c = dp[i][0] + (suf[i+1] - suf[mid+1]) * suf[mid+1];
		if(c >= dp[mid][1]){
			dp[mid][1] = c;
			opt[mid][k] = i;
		}
	}
	solve(l, mid-1, optl, opt[mid][k], k); solve(mid+1, r, opt[mid][k], optr, k);
}
 
int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int n, k;
	cin >> n >> k;
	for(int i=1; i<=n; i++) cin >> v[i];
	for(int i=n; i>=1; i--) suf[i] = v[i] + suf[i+1];
	for(int i=1; i<n; i++) dp[i][0] = (suf[1] - suf[i+1]) * suf[i+1];
	for(int i=2; i<=k; i++){
		solve(1, n-1, 1, n-1, i);
		for(int j=1; j<=n; j++) dp[j][0] = dp[j][1];
	}
	int id = 1;
	for(int i=2; i<n; i++) if(dp[i][0] > dp[id][0]) id = i;
	cout << dp[id][0] << "\n";
	vector<int> ans;
	for(int i=k; i>=1; i--){
		ans.push_back(id);
		id = opt[id][i];
	}
	for(int i=((int)ans.size())-1; i>=0; i--) cout << ans[i] << " ";
	cout << "\n";
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 340 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 324 KB contestant found the optimal answer: 0 == 0
4 Correct 1 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 324 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 340 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 340 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 332 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 340 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 340 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 340 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 340 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 320 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 328 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 340 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 448 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 468 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 468 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 520 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 468 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 468 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 468 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 468 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 516 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1096 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 1212 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1108 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 1108 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 1108 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1108 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 1108 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 1096 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 1108 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 6 ms 8788 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 8788 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 76 ms 8916 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 8932 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 71 ms 8884 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 66 ms 8788 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 66 ms 8916 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 47 ms 8900 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 60 ms 8896 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 69 ms 8900 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 54 ms 85792 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 59 ms 85716 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1356 ms 86128 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 50 ms 86092 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1529 ms 85908 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 998 ms 85824 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1212 ms 86080 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 929 ms 86000 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 993 ms 86088 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1336 ms 85976 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845