oj.uz

Submission #57056

# Submission time Handle Problem Language Result Execution time Memory
57056 2018-07-13T17:19:01 Z Plurm Split the sequence (APIO14_sequence) C++17
100 / 100
 619 ms 85940 KB 
#include <cstdio>
#include <cstring>
int a[100005];
long long dp[100005];
long long qs[100005];
int par[256][100005];
struct cst{
	long long M,C;
	int idx;
} L1[100005], L2[100005];
int prt[100005];
int ptr1,ptr2;
int csz1,csz2;
inline bool bad(cst x, cst y, cst z){
	return (x.M-y.M)*(z.C-x.C) <= (x.M-z.M)*(y.C-x.C);
}
cst o;
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	k++;
	csz1++;
	for(int i = 1; i <= n; i++){
		scanf("%d",a+i);
		qs[i] = qs[i-1] + (long long)a[i];
		dp[i] = -1e16;
	}
	for(int j = 1; j <= k; j++){
		csz2 = ptr2 = 0;
		for(int i = j; i <= n; i++){
			if(ptr1 >= csz1) ptr1 = csz1-1;
			while(ptr1 < csz1-1 && (L1[ptr1+1].M-L1[ptr1].M)*qs[i] + L1[ptr1+1].C-L1[ptr1].C > 0) ptr1++;
			par[j][i] = L1[ptr1].idx;
			dp[i] = L1[ptr1].M*qs[i] + L1[ptr1].C;
			o.M = qs[i];
			o.C = dp[i]-qs[i]*qs[i];
			o.idx = i;
			while(csz2 >= 2 && bad(L2[csz2-2],L2[csz2-1],o)) csz2--;
			L2[csz2++] = o;
		}
		for(int i = 0; i < csz2; i++){
			L1[i] = L2[i];
		}
		csz1 = csz2;
		ptr1 = ptr2;
	}
	printf("%lld\n",dp[n]);
	int x = n;
	csz1 = 0;
	for(int j = k; j > 1; j--){
		x = par[j][x];
		prt[csz1++] = x;
	}
	for(int i = 0; i < csz1; i++){
		printf("%d ",prt[i]);
	}
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:20: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:24: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 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 3 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 3 ms 456 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 468 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 516 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 516 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 520 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 520 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 520 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 3 ms 520 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 544 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 544 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 544 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 548 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 560 KB contestant found the optimal answer: 805 == 805
16 Correct 3 ms 560 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 612 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2332 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 2332 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 58 ms 9980 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 9980 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 43 ms 9980 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 37 ms 9980 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 48 ms 9980 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 37 ms 9980 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 42 ms 9980 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 49 ms 9980 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 9980 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 24 ms 9980 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 613 ms 85940 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 32 ms 85940 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 619 ms 85940 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 377 ms 85940 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 475 ms 85940 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 373 ms 85940 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 342 ms 85940 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 507 ms 85940 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845