Submission #32104

# Submission time Handle Problem Language Result Execution time Memory
32104 2017-09-25T14:38:46 Z polingy Split the sequence (APIO14_sequence) C++14
100 / 100
513 ms 86784 KB
#include <bits/stdc++.h>
using namespace std;
 
const int MAX = 100005;
typedef long long ll;
typedef pair<ll, ll> pll;
 
 
#define f first
#define s second
 
 
pll line[MAX];
int orig[MAX];
int ct = 0;
int ptr = 0;
bool bad(pll l0, pll l1, pll l2) {
	return (l1.s-l0.s)*(l0.f-l2.f) >= (l0.f-l1.f)*(l2.s-l0.s);
}
 
ll f(pll l, ll x) {
	return l.f * x + l.s;
}
void add(pll l, int i) {
	while (ct >= 2 && ptr < ct && bad(line[ct-1], line[ct], l)) {
		ct--;
	}
	ptr = min(ptr, ct);
	ct++;
	line[ct] = l;
	orig[ct] = i;
}
 
pair<ll, int> get(ll x) {
	ptr = max(ptr, 1);
	if (ct == 0) { return {0, 0}; }
	while (ptr < ct && f(line[ptr], x) < f(line[ptr+1], x)) {
		ptr++;
	}
	return {f(line[ptr], x), orig[ptr]};
}
 
int a[MAX];
ll p[MAX];
ll dp[MAX][2];
int last[205][MAX];
int main() {
	// double c = clock();
	//freopen("a.in", "r", stdin);
	//freopen("a.out", "w", stdout);
 
	int n, k0; scanf("%d %d", &n, &k0);
	for (int i=1; i<=n; i++) {
		scanf("%d", &a[i]); 
		p[i] = (ll)p[i-1] + (ll)a[i];
	}
	for (int k=1; k<=k0+1; k++) {
		ct = 0;
		for (int i=k-1; i<=n; i++) {
			if (k == 1) { 
				dp[i][k] = 0;
			}
			else {
				add({p[i], (ll)dp[i][(k+1)%2]-(ll)p[i]*(ll)p[i]}, i);
				if (i != k-1) { 
					pll ans = get(p[i]);
					dp[i][k%2] = ans.f; 
					last[k][i] = (int)ans.s;
				}
			}
		}
	}
	k0++;
	printf("%lld\n", dp[n][k0%2]);
	while (k0 != 1) {
		int bef = last[k0][n];
		printf("%d ", bef);
		n = bef; k0--;
	}
	// cout << (clock() - c) / (double)CLOCKS_PER_SEC;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:52:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, k0; scanf("%d %d", &n, &k0);
                                    ^
sequence.cpp:54:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]); 
                     ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 86784 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 86784 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 86784 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 86784 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 86784 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 86784 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 86784 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 86784 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 86784 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 86784 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 86784 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 86784 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 86784 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 86784 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 86784 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 86784 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 86784 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 86784 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 86784 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 86784 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 86784 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 86784 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 86784 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 86784 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 86784 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 86784 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 86784 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 0 ms 86784 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 86784 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 86784 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 86784 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 86784 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 86784 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 86784 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 86784 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 86784 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 86784 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 0 ms 86784 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 86784 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 3 ms 86784 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 86784 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 3 ms 86784 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 0 ms 86784 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 3 ms 86784 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 3 ms 86784 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 86784 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 86784 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 0 ms 86784 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 86784 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 26 ms 86784 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 86784 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 26 ms 86784 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 29 ms 86784 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 39 ms 86784 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 26 ms 86784 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 29 ms 86784 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 33 ms 86784 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 6 ms 86784 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 16 ms 86784 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 323 ms 86784 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 16 ms 86784 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 513 ms 86784 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 353 ms 86784 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 389 ms 86784 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 266 ms 86784 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 286 ms 86784 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 346 ms 86784 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845