Submission #399009

# Submission time Handle Problem Language Result Execution time Memory
399009 2021-05-05T03:45:09 Z wnguscjf01 Split the sequence (APIO14_sequence) C++14
100 / 100
1595 ms 87628 KB
#include<bits/stdc++.h>
#define MAXK 201
#define MAXN 100001
using namespace std;
struct data{
	long long int slope, yy;
	double s;
	int num;
};
struct data d[2][MAXN];
bool compare(const struct data &a, const struct data &b){
	return a.s < b.s;
}
double cross(struct data &a, struct data &b){
	if(a.slope == b.slope) return -1.0*LLONG_MIN;
	return 1.0*(b.yy-a.yy)/(a.slope-b.slope);
}
long long int ans[2][MAXN], sum[MAXN];
int dsize[2], tr[MAXK][MAXN], ans2[MAXN];
int main()
{
	int n, k, i, j;
	cin >> n >> k;
	
	for(i=1; i<=n; i++){
		int aa;
		scanf("%d",&aa);
		sum[i] = sum[i-1]+aa;
	}
	
	for(j=1; j<=k; j++){
		dsize[j%2]=0;
		for(i=j; i<n; i++){
			struct data tmp;
			tmp.s = sum[i];
			int p = lower_bound(d[(j-1)%2]+1, d[(j-1)%2]+dsize[(j-1)%2]+1,tmp,compare)-d[(j-1)%2]-1;
			ans[j%2][i] = d[(j-1)%2][p].slope*sum[i] + d[(j-1)%2][p].yy + sum[i]*sum[n] - sum[i]*sum[i];
			tr[j][i] = d[(j-1)%2][p].num;
			
			dsize[j%2]++;
			d[j%2][dsize[j%2]].slope = sum[i];
			d[j%2][dsize[j%2]].yy = ans[j%2][i] - sum[i]*sum[n];
			d[j%2][dsize[j%2]].num = i;
			if(dsize[j%2]==1) d[j%2][dsize[j%2]].s = INT_MIN;
			else{
				while(dsize[j%2] > 1 && cross(d[j%2][dsize[j%2]],d[j%2][dsize[j%2]-1]) <= d[j%2][dsize[j%2]-1].s){
					d[j%2][dsize[j%2]-1] = d[j%2][dsize[j%2]];
					dsize[j%2]--;
				}
				d[j%2][dsize[j%2]].s = cross(d[j%2][dsize[j%2]],d[j%2][dsize[j%2]-1]);
			}
		}
		/*for(i=1; i<n; i++){
			printf("%lld  ",ans[j%2][i]);
		}
		cout << endl;*/
	}
	
	int maxind = 1;
	for(i=k; i<n; i++){
		if(ans[k%2][i] > ans[k%2][maxind]) maxind = i;
	}
	printf("%lld\n",ans[k%2][maxind]);
	int p = k, q = maxind;
	while(1){
		if(p<1) break;
		ans2[p] = q;
		q = tr[p][q];
		p--;
	}
	for(i=1; i<=k; i++) printf("%d ",ans2[i]);
	
	return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
/*
5 4
8 9 6 2 5
*/
/*
17 5
9 7 0 0 0 1 6 0 0 8 3 0 8 10 2 0 4
*/
/*
10 5
9 7 1 6 8 3 8 10 2 4
*/

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   scanf("%d",&aa);
      |   ~~~~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 388 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 332 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 332 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 332 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 332 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 332 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 332 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 332 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 336 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 332 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 332 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 332 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 332 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 332 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 332 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 332 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 332 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 332 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 460 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 332 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 332 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 332 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 460 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 332 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 332 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 304 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 332 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 1356 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 304 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 972 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1228 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 1356 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 588 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 460 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 588 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 332 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 11 ms 1996 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 460 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 13 ms 1996 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 11 ms 1796 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 13 ms 1980 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 11 ms 2040 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 716 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 6 ms 972 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1100 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 1100 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 153 ms 9796 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 1356 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 96 ms 6212 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 90 ms 7012 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 114 ms 7652 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 92 ms 6468 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 111 ms 7140 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 141 ms 8964 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 31 ms 8652 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 29 ms 8884 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1556 ms 87628 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 32 ms 10348 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1595 ms 86012 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 934 ms 62104 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1174 ms 68012 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 924 ms 57020 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1133 ms 63556 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1449 ms 79172 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845