oj.uz

Submission #241055

# Submission time Handle Problem Language Result Execution time Memory
241055 2020-06-22T12:03:07 Z maximath_1 Split the sequence (APIO14_sequence) C++11
100 / 100
 817 ms 83960 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n, k, a[100005], cht[100005], bt[100005][205];
ll pref[100005], dp[100005], dplast[100005];
long double slp(int id1, int id2){
	if(pref[id1]==pref[id2]) return -1e18;
	return (long double)((dplast[id1]-pref[id1]*pref[id1])-(dplast[id2]-pref[id2]*pref[id2]))/(long double)(pref[id2]-pref[id1]);
}
int main(){
	scanf("%d%d", &n, &k);
	for(int i=1; i<=n; i++){
		scanf("%d", &a[i]);
		pref[i]=pref[i-1]+a[i];
	}
	for(int j=1; j<=k; j++){
		int lf=1, rg=0;
		cht[++rg]=0;
		for(int i=1; i<=n; i++){
			while(lf<rg && slp(cht[lf], cht[lf+1])<=pref[i]) lf++;
			dp[i]=dplast[cht[lf]]+pref[cht[lf]]*(pref[i]-pref[cht[lf]]);
			bt[i][j]=cht[lf];
			while(lf<rg && slp(cht[rg-1], cht[rg])>=slp(cht[rg], i)) rg--;
			cht[++rg]=i;
		}
		for(int i=1; i<=n; i++)
			dplast[i]=dp[i];
	}
	printf("%lld\n", dp[n]);
	for(int x=n, i=k; i>=1; i--){
		x=bt[x][i];
		printf("%d%c", x, (i==1?'\n':' '));
	}
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 1152 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 9 ms 1152 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 1152 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 12 ms 1152 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 10 ms 1152 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 11 ms 1152 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 10 ms 1152 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 6 ms 1152 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 1152 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8704 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 10 ms 8704 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 51 ms 8704 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 10 ms 8704 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 50 ms 8704 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 48 ms 8704 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 63 ms 8704 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 40 ms 8704 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 46 ms 8704 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 56 ms 8704 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 83576 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 61 ms 83576 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 567 ms 83704 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 62 ms 83704 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 817 ms 83704 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 517 ms 83576 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 636 ms 83960 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 437 ms 83832 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 456 ms 83576 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 566 ms 83704 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845