oj.uz

Submission #365294

# Submission time Handle Problem Language Result Execution time Memory
365294 2021-02-11T11:58:26 Z saleh Split the sequence (APIO14_sequence) C++17
71 / 100
 2000 ms 9324 KB 
#include <bits/stdc++.h>
 
 
using namespace std;
 
 
const int MAXN = 100 * 1000 + 2, MAXK = 200 + 2;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
int n, k, chi, lvl;
int par[MAXK][MAXN];
long long dp[2 + 2][MAXN], ps[MAXN];
 
void cal(int l = chi, int r = n + 1, int ll = chi, int rr = n) {
	int mid = ((l + r) >> 1), md;
	long long j;
	for (int i = ll; i < mid && i < r; i++) if ((j = dp[1 - lvl][i] + ps[i] * (ps[mid] - ps[i])) > dp[lvl][mid]) {
		dp[lvl][mid] = j;
		md = i;
	}
	par[chi][mid] = md;
	if (l < mid) cal(l, mid, ll, md);
	if (mid + 1 < r) cal(mid + 1, r, md, rr);
}
 
 
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	cin >> n >> k;
	int a;
	for (int i = 0; i < n; i++) {
		cin >> a;
		ps[i + 1] = ps[i] + a;
	}
	for (int i = 1; i <= k; i++) {
		chi = i;
		lvl = i & 1;
		for (int j = i; j <= n; j++) dp[lvl][j] = -1;
		cal();
	}
	cout << dp[k & 1][n] << '\n';
	while (k > 0) {
		cout << par[k][n] << ' ';
		n = par[k][n];
		k--;
	}
	return 0;
}

Compilation message

sequence.cpp: In function 'void cal(int, int, int, int)':
sequence.cpp:36:18: warning: 'md' may be used uninitialized in this function [-Wmaybe-uninitialized]
   36 |  if (l < mid) cal(l, mid, ll, md);
      |               ~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 364 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 1396 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 364 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 1132 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1260 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 1388 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 620 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 492 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 620 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 364 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 2028 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 364 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 15 ms 2028 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 12 ms 1772 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 11 ms 2028 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 11 ms 2028 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 748 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 1132 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 748 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 171 ms 876 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 379 ms 9324 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 69 ms 748 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 432 ms 5868 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 333 ms 6764 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 336 ms 7148 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 339 ms 5996 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 336 ms 6764 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 377 ms 8428 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2069 ms 2540 KB Time limit exceeded
2 Halted 0 ms 0 KB -