oj.uz

Submission #990079

# Submission time Handle Problem Language Result Execution time Memory
990079 2024-05-29T13:48:23 Z StefanSebez Split the sequence (APIO14_sequence) C++14
71 / 100
 50 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
const int N=1e5+50;
const ll inf=1e18;
int n,K,a[N];
ll dp[N][210],pref[N];
int parent[N][210];
/*int root,nc,lc[2*N],rc[2*N],sum[2*N],sum1[2*N],lazy[2*N];

void pull(int c){
	sum1[c]=sum1[lc[c]]+sum1[rc[c]];
	sum[c]=sum[lc[c]]+sum[rc[c]]+sum1[c]*sum1[c]-sum1[lc[c]]*sum1[lc[c]]-sum1[rc[c]]*sum1[rc[c]];
}
void update(int c,int qval){
	sum[c]+=qval*qval+2*sum1[c]*qval;
	sum1[c]+=qval;
	lazy[c]+=qval;
}
void push(int c){
	update(lc[c],lazy[c]);
	update(rc[c],lazy[c]);
	lazy[c]=0;
}
void Build(int &c,int ss,int se,int k){
	if(!c) c=++nc;
	sum[c]=sum1[c]=lazy[c]=0;
	if(ss==se){
		sum[c]=dp[ss][k];
		return;
	}
	int mid=ss+se>>1;
	Build(lc[c],ss,mid,k),Build(rc[c],mid+1,se,k);
	pull(c);
}
void Update(int &c,int ss,int se,int qs,int qe,int qval){
	if(qs>qe) return;
	if(qs<=ss && se<=qe){
		update(c,qval);
		return;
	}
	if(qe<ss || se<qs) return;
	int mid=ss+se>>1;
	push(c);
	Update(lc[c],ss,mid,qs,qe,qval),Update(rc[c],mid+1,se,qs,qe,qval);
	pull(c);
}
int Get(int c,int ss,int se,int qs,int qe){
	if(qs>qe) return inf;
	if(qs<=ss && se<=qe) return sum[c];
	if(qe<ss || se<qs) return inf;
	int mid=ss+se>>1;
	push(c);
	return min(Get(lc[c],ss,mid,qs,qe),Get(rc[c],mid+1,se,qs,qe));
}*/
ll Cost(int l,int r){return (pref[r]-pref[l-1])*(pref[r]-pref[l-1]);}
void Solve(int l,int r,int L,int R,int k){
	if(l>r) return;
	int mid=l+r>>1;
	int ind=L;
	dp[mid][k]=inf;
	for(int i=min(mid-1,R);i>=L;i--){
		if(dp[mid][k]>=dp[i][k-1]+Cost(i+1,mid)){
			dp[mid][k]=dp[i][k-1]+Cost(i+1,mid);
			ind=i;
		}
	}
	parent[mid][k]=ind;
	Solve(l,mid-1,L,ind,k);
	Solve(mid+1,r,ind,R,k);
}
int main(){
    scanf("%i%i",&n,&K);
    for(int i=1;i<=n;i++) scanf("%i",&a[i]);
    for(int i=1;i<=n;i++) pref[i]=pref[i-1]+a[i];
    for(ll i=0,sum=0;i<=n;i++) sum+=a[i],dp[i][0]=sum*sum;
	/*for(int k=1;k<=K;k++){
		Build(root,0,n,k-1);
		dp[0][k]=inf;
		for(int i=0;i<=n;i++) printf("%i ",Get(root,0,n,i,i));
		printf("\n");
		for(int i=1;i<=n;i++){
			Update(root,0,n,0,i-1,a[i]);
			dp[i][k]=Get(root,0,n,0,i-1);
			for(int i=0;i<=n;i++) printf("%i ",Get(root,0,n,i,i));
			printf("\n");
			//for(int j=i-1,sum=0;j>=0;j--){
				//sum+=a[j+1];
				//dp[i][k]=min(dp[i][k],dp[j][k-1]+sum*sum);
			//}
		}
		printf("\n");
	}
	for(int k=0;k<=K;k++){printf("%i: ",k);for(int i=0;i<=n;i++){printf("%i ",dp[i][k]);}printf("\n");}*/
	for(int k=1;k<=K;k++){
		Solve(1,n,1,n,k);
	}
	ll res=0;
	for(int i=1;i<=n;i++) res+=a[i];
	res=(res*res-dp[n][K])/2;
	printf("%lld\n",res);
	vector<int>ans;
	int temp=K,nesto=n;
	while(temp>0){
		ans.pb(parent[nesto][temp]);
		nesto=parent[nesto][temp];
		temp--;
	}
	for(auto i:ans) printf("%i ",i);
	printf("\n");
    return 0;
}

Compilation message

sequence.cpp: In function 'void Solve(int, int, int, int, int)':
sequence.cpp:62:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |  int mid=l+r>>1;
      |          ~^~
sequence.cpp: In function 'int main()':
sequence.cpp:76:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     scanf("%i%i",&n,&K);
      |     ~~~~~^~~~~~~~~~~~~~
sequence.cpp:77:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     for(int i=1;i<=n;i++) scanf("%i",&a[i]);
      |                           ~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 27240 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 27240 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 50 ms 27376 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 27240 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 38 ms 27240 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 35 ms 27228 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 45 ms 27224 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 31 ms 27224 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 44 ms 27228 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 48 ms 27228 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -