oj.uz

Submission #43708

# Submission time Handle Problem Language Result Execution time Memory
43708 2018-03-20T17:05:56 Z baactree Split the sequence (APIO14_sequence) C++14
100 / 100
 987 ms 83524 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll dp[2][100005];
int par[205][100005];
ll sum[100005];
int arr[100005];
pair<ll, ll> dd[100005];
long double calc(pair<ll, ll> a, pair<ll, ll> b) {
	return ((long double)a.second - b.second) / (b.first - a.first);
}
void push(int i, int j,deque<int> &dq) {
	ll a = sum[j];
	ll b = dp[(i-1)&1][j] - sum[j] * sum[j];
	dd[j] = make_pair(a, b);
	while (dq.size() > 1 && (dd[dq.back()].second-dd[j].second)*(-dd[dq[dq.size() - 2]].first + dd[j].first) <= (dd[dq[dq.size() - 2]].second-dd[j].second)*(-dd[dq.back()].first + dd[j].first))
		dq.pop_back();
	dq.push_back(j);
}
int main() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &arr[i]);
		sum[i] = sum[i - 1] + arr[i];
	}
	for (int i = 1; i <= k; i++) {
		deque<int> dq;
		int cur = i & 1;
		int pre = (i - 1) & 1;
		push(i,i,dq);
		for (int j = i + 1; j <= n; j++) {
			while (dq.size() > 1 && (dd[dq[0]].second - dd[dq[1]].second) <= sum[j]*(dd[dq[1]].first-dd[dq[0]].first))
				dq.pop_front();
			dp[cur][j] = dd[dq[0]].first * sum[j] + dd[dq[0]].second;
			par[i][j] = dq[0];
			push(i,j,dq);
		}
	}
	printf("%lld\n", dp[k & 1][n]);
	while (k) {
		printf("%d ", par[k][n]);
		n = par[k][n];
		k--;
	}
	printf("\n");
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:30:7: warning: unused variable 'pre' [-Wunused-variable]
   int pre = (i - 1) & 1;
       ^
sequence.cpp:22:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
                       ^
sequence.cpp:24:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &arr[i]);
                       ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1644 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 1644 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 2284 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2284 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 11 ms 2284 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 2284 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 2284 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 9 ms 2284 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 5 ms 2284 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 2284 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2284 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 2284 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 77 ms 9840 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 9840 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 58 ms 9840 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 62 ms 9840 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 68 ms 9840 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 51 ms 9840 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 57 ms 9840 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 78 ms 9840 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9840 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 27 ms 9840 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 727 ms 83320 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 26 ms 83320 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 987 ms 83524 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 644 ms 83524 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 689 ms 83524 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 542 ms 83524 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 598 ms 83524 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 758 ms 83524 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845