Submission #5686

# Submission time Handle Problem Language Result Execution time Memory
5686 2014-05-13T01:47:48 Z cki86201 Split the sequence (APIO14_sequence) C++
100 / 100
516 ms 85860 KB
#include<stdio.h>
#include<set>

typedef long long ll;
typedef std::pair<ll,ll> pl;
#define X first
#define Y second

int n, k, s[100010];
ll d[2][100010];
int b[202][100010];
int ans[202];
struct deq{
	pl p[100010];
	int w[100010];
	int f, r;
	void init(){f=r=0;}
	void push(pl x,int c){
		while(f-r>1 && (p[f-1].X - p[f-2].X) * (x.Y - p[f-1].Y) >= (x.X - p[f-1].X) * (p[f-1].Y - p[f-2].Y))--f;
		p[f] = x, w[f++] = c;
	}
	ll pop(ll x){
		while(f-r>1 && (x*p[r].X + p[r].Y) <= (x*p[r+1].X + p[r+1].Y))++r;
		return x*p[r].X + p[r].Y;
	}
	inline int prev(){return w[r];}
}Deq[2];

int main()
{
	scanf("%d%d",&n,&k);
	int i;
	for(i=1;i<=n;i++)scanf("%d",s+i);
	for(i=1;i<=n;i++)s[i] += s[i-1];
	for(int j=1;j<=k;j++){
		int t = j&1;
		Deq[t].init();
		for(i=1;i<=n;i++){
			d[t][i] = Deq[!t].pop(s[i]);
			b[j][i] = Deq[!t].prev();
			Deq[!t].push(pl(s[i], d[!t][i] - (ll)s[i]*s[i]), i);
		}
	}
	printf("%lld\n",d[k&1][n]);
	int now = n;
	for(i=k;i;i--)now = b[i][now], ans[i] = now;
	for(i=1;i<=k;i++)printf("%d ",ans[i]);
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 85860 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 85860 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 85860 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 85860 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 4 ms 85860 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 85860 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 24 ms 85860 KB Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 85860 KB Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 32 ms 85860 KB Output is correct - contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 28 ms 85860 KB Output is correct - contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 32 ms 85860 KB Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 24 ms 85860 KB Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 20 ms 85860 KB Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 40 ms 85860 KB Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 16 ms 85860 KB Output is correct - contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 16 ms 85860 KB Output is correct - contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 336 ms 85860 KB Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 8 ms 85860 KB Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 516 ms 85860 KB Output is correct - contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 328 ms 85860 KB Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 400 ms 85860 KB Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 268 ms 85860 KB Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 276 ms 85860 KB Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 356 ms 85860 KB Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845