oj.uz

Submission #100230

# Submission time Handle Problem Language Result Execution time Memory
100230 2019-03-09T21:13:08 Z TadijaSebez Split the sequence (APIO14_sequence) C++11
100 / 100
 1443 ms 82040 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100050;
const int K=205;
const ll inf=1e18;
int a[N];
ll sum[N];
ll dp[N][2];
int best[K][N];
void Solve(int k, int ss, int se, int l, int r)
{
	if(ss>se) return;
	int mid=ss+se>>1;
	dp[mid][k&1]=-inf;
	for(int i=l;i<=min(r,mid);i++)
	{
		ll tmp=dp[i-1][(k&1)^1]+(sum[mid]-sum[i-1])*sum[i-1];
		if(tmp>dp[mid][k&1]) dp[mid][k&1]=tmp,best[k][mid]=i;
	}
	Solve(k,ss,mid-1,l,best[k][mid]);
	Solve(k,mid+1,se,best[k][mid],r);
}
int main()
{
	int n,k;
	scanf("%i %i",&n,&k);k++;
	for(int i=1;i<=n;i++) scanf("%i",&a[i]),sum[i]=sum[i-1]+a[i],dp[i][0]=-inf;
	for(int i=1;i<=k;i++) Solve(i,i,n,i,n);
	printf("%lld\n",dp[n][k&1]);
	vector<int> ans;
	for(int i=n,j=k;i>0;i=best[j][i]-1,j--) ans.push_back(i);
	reverse(ans.begin(),ans.end());
	ans.pop_back();
	for(int i:ans) printf("%i ",i);
	return 0;
}

Compilation message

sequence.cpp: In function 'void Solve(int, int, int, int, int)':
sequence.cpp:14:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
sequence.cpp: In function 'int main()':
sequence.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&k);k++;
  ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:28:62: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%i",&a[i]),sum[i]=sum[i-1]+a[i],dp[i][0]=-inf;
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 896 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 768 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 71 ms 9400 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 768 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 293 ms 5852 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 74 ms 6776 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 69 ms 7160 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 51 ms 6008 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 78 ms 6776 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 90 ms 8440 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 4600 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 49 ms 4600 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 752 ms 82040 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 28 ms 4728 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1443 ms 82032 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 919 ms 58488 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 801 ms 62240 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 551 ms 51356 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 807 ms 58444 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 995 ms 74104 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845