oj.uz

Submission #7648

# Submission time Handle Problem Language Result Execution time Memory
7648 2014-08-13T10:50:04 Z imsifile Split the sequence (APIO14_sequence) C++
33 / 100
 4 ms 85548 KB 
#include<stdio.h>
#define sq(a) ((a)*(a))
#define sik(l,x) ((l.a)*(x)+(l.b))

typedef long long lld;

struct lin {
	int ix;
	lld a, b; // ax+b
}stk[100100], im;

int n, k, di[100100][202], scn;
lld ba[100100], dy[100100][2], sum[100100];

int main(){
	int i, i2, j, t=1;
	scanf("%d%d", &n, &k);
	for(i=1; i<=n; i++)scanf("%lld", &ba[i]), sum[i]=sum[i-1]+ba[i];
	for(i=1; i<=n; i++)dy[i][0]=sq(sum[i]);
	for(j=1; j<=k; j++){
		im.a=-2*sum[j], im.b=dy[j][1-t]+sq(sum[j]), im.ix=j;
		stk[0]=im, scn=1;
		for(i=1; i<=j; i++)dy[i][t]=0;
		for(i=j+1, i2=0; i<=n; i++){
			for(; i2<scn-1; i2++){
				if(sik(stk[i2],sum[i])<sik(stk[i2+1],sum[i]))break;
			}
			di[i][j]=stk[i2].ix, dy[i][t]=sq(sum[i])+sik(stk[i2],sum[i]);
			im.ix=i, im.a=-2*sum[i], im.b=dy[i][1-t]+sq(sum[i]);
			for(; scn; scn--){
				if(stk[scn-1].b<im.b)break;
			}
			stk[scn++]=im;
			if(i2>=scn)i2=scn-1;
		}
		t=1-t;
	}
	printf("%lld\n", (sq(sum[n])-dy[n][1-t])/2);
	for(i=n, j=k; j>0; j--)printf("%d ", di[i][j]), i=di[i][j];
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 85548 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 85548 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 85548 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 85548 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 85548 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 4 ms 85548 KB Output isn't correct - contestant didn't find the optimal answer: 4698976842 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -