oj.uz

Submission #160365

# Submission time Handle Problem Language Result Execution time Memory
160365 2019-10-27T07:15:55 Z gs18103 Split the sequence (APIO14_sequence) C++14
100 / 100
 1750 ms 81568 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll sum[101010], dp[2][101010];
int n, k;
int pre[202][101010];

void dnc(int t, int s, int e, int l, int r) {
	int m = s + e >> 1;
	int idx;
	dp[t%2][m] = 0;
	for(int i = min(m-1, r); i >= l; i--) {
		if(dp[(t+1)%2][i] + (sum[m]-sum[i]) * (sum[n]-sum[m]) > dp[t%2][m]) {
			dp[t%2][m] = dp[(t+1)%2][i] + (sum[m]-sum[i]) * (sum[n]-sum[m]);
			idx = pre[t][m] = i;
		}
	}
	if(s == e) return;
	dnc(t, s, m, l, idx);
	dnc(t, m+1, e, idx, r);
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	cin >> n >> k;
	for(int i = 1; i <= n; i++) {
		ll u; cin >> u;
		sum[i] = sum[i-1] + u;
	}
	for(int i = 1; i < n; i++) {
		dp[1][i] = sum[i] * (sum[n] - sum[i]);
	}
	for(int i = 2; i <= k; i++) {
		dnc(i, i, n-1, i-1, n-2);
	}
	
	ll ans = 0;
	int cur;
	for(int i = 1; i < n; i++) {
		if(ans <= dp[k%2][i]) {
			ans = dp[k%2][i];
			cur = i;
		}
	}
	cout << ans << endl;
	if(ans == 0) {
		for(int i = 1; i <= k; i++) {
			cout << i << ' ';
		}
		return 0;
	}
	vector <int> v;
	for(int i = k; i >= 1; i--) {
		cout << cur << ' ';
		cur = pre[i][cur];
	}
}

Compilation message

sequence.cpp: In function 'void dnc(int, int, int, int, int)':
sequence.cpp:11:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = s + e >> 1;
          ~~^~~
sequence.cpp:21:5: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
  dnc(t, s, m, l, idx);
  ~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 2040 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 348 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 14 ms 2040 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 12 ms 1784 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 26 ms 2040 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 10 ms 2168 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 5 ms 760 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 1016 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 760 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 91 ms 9180 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 10 ms 632 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 96 ms 5752 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 92 ms 6648 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 95 ms 7196 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 70 ms 5852 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 92 ms 6660 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 112 ms 8440 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3444 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 30 ms 3444 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 982 ms 81568 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 24 ms 3448 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1750 ms 81404 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1076 ms 57760 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1056 ms 62072 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 734 ms 50960 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 923 ms 58076 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1194 ms 73972 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845