Submission #5860

# Submission time Handle Problem Language Result Execution time Memory
5860 2014-05-19T12:54:28 Z gs12037 Split the sequence (APIO14_sequence) C++
100 / 100
652 ms 90196 KB
#include <stdio.h>
#include <algorithm>
#include <vector>
#define M 100004
#define INF 1234567890
using namespace std;
int n, k;
struct pp{
	long long int a, b;
	int pos;
};
vector<pp> v;
long long int d[2][M], ans, s[M];
int path[209][M], pri[M];
int main(){
	int i, j;
	pp e;
	scanf("%d %d", &n, &k);
	for (i = 1; i <= n; i++) scanf("%lld", &s[i]);
	for (i = 1; i <= n; i++) s[i] = s[i - 1] + s[i];

	for (i = 1; i <= k; i++){
		v.clear();
		for (j = i; j <= n; j++){
			e.a = s[j]; e.b = d[0][j] - (long long)s[j] * s[j]; e.pos = j;
			while (v.size() > 1){
				int EE = v.size() - 1;
				if ((v[EE].a - v[EE - 1].a)*(e.b - v[EE].b) >= (e.a - v[EE].a)*(v[EE].b - v[EE - 1].b)) v.pop_back();
				else break;
			}
			v.push_back(e);
		}
		e.a = 0; e.b = -INF; e.pos = 0; v.push_back(e);
		int pivot = 0;
		for (j = i; j <= n; j++){
			while (s[j] * v[pivot].a + v[pivot].b <= s[j] * v[pivot + 1].a + v[pivot + 1].b && v[pivot + 1].pos < j) pivot++;
			d[1][j] = s[j] * v[pivot].a + v[pivot].b;
			path[i][j] = v[pivot].pos;
		}
		for (j = i; j <= n; j++) d[0][j] = d[1][j];
	}
	printf("%lld\n", d[1][n]);
	int temp = path[k][n];
	for (i = k; i >= 1; i--){
		pri[i] = temp;
		temp = path[i - 1][temp];
	}
	for (i = 1; i <= k; i++) printf("%d ", pri[i]);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 85584 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 85584 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 4 ms 85584 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 85584 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 85584 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85968 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 85968 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 36 ms 86164 KB Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 86164 KB Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 40 ms 85968 KB Output is correct - contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 36 ms 85968 KB Output is correct - contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 44 ms 86164 KB Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 24 ms 86164 KB Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 28 ms 86164 KB Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 36 ms 86164 KB Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 12 ms 90196 KB Output is correct - contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 24 ms 90196 KB Output is correct - contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 416 ms 90196 KB Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 90196 KB Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 652 ms 90196 KB Output is correct - contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 388 ms 90196 KB Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 432 ms 90196 KB Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 296 ms 90196 KB Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 340 ms 90196 KB Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 412 ms 90196 KB Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845