oj.uz

Submission #90035

# Submission time Handle Problem Language Result Execution time Memory
90035 2018-12-19T19:21:22 Z KLPP Split the sequence (APIO14_sequence) C++14
71 / 100
 207 ms 132096 KB 
#include<stdio.h>
#include<iostream>
#include<deque>
#include<queue>
using namespace std;
typedef long long int lld;
#define INF 1000000000000000000
typedef pair<lld,lld> line;
lld DP[100001][202];
int pre[100001][202];
lld sq(lld x){
	return x*x;
}
class CH{
	deque<pair<line,int> > d;
	public:
	void print(){
		queue<pair<line,int> >q;
		while(!d.empty()){
			q.push(d.front());
			cout<<d.front().first.first<<" "<<d.front().first.second<<" "<<d.front().second<<endl;
			d.pop_front();
		}
		while(!q.empty()){
			d.push_back(q.front());
			q.pop();
		}
	}
	double intersect(pair<line,int> a, pair<line,int> b){
		return (double)(a.first.first-b.first.first)/(b.first.second-a.first.second);
	}
	void add(line l, int index){
		pair<line,int> P;
		P.first=l;
		P.second=index;
		while(d.size()>0 && P.first.second==d.back().first.second){
			if(P.first.first<d.back().first.first){
				d.pop_back();
			}else{
				return;
			}
		}
		if(d.size()<2){
			d.push_back(P);
			return;
		}
		pair<line,int> A;
		pair<line,int> B;
		do{
			A=d.back();
			d.pop_back();
			B=d.back();
			//cout<<intersect(P,A)<<" "<<intersect(P,B)<<endl;
		}while(d.size()>1 && intersect(P,A)<=intersect(P,B));
		if(intersect(P,A)>intersect(P,B))d.push_back(A);
		d.push_back(P);
	}
	int size(){
		return d.size();
	}
	int query(lld c){
		if(d.size()==1){
			return d.front().second;
		}
		pair<line,int> A;
		pair<line,int> B;
		do{
			A=d.front();
			d.pop_front();
			B=d.front();
		}while(d.size()>1 && intersect(A,B)<=c);
		if(intersect(A,B)>c)d.push_front(A);
		return d.front().second;
	}
	void clear(){
		while(!d.empty())d.pop_back();
	}
};
int main(){
	int n,k;
	scanf("%d %d",&n,&k);
	//cin>>n>>k;
	lld arr[n];
	lld acc[n+1];
    	for(int i=0;i<n;i++){
    		scanf("%lld",&arr[i]);
		//cin>>arr[i];
    	}
    	acc[0]=0;
    	for(int i=0;i<n;i++){
    		acc[i+1]=acc[i]+arr[i];
    	}
    	for(int i=0;i<=n;i++){
    		for(int j=0;j<=k+1;j++){
    			DP[i][j]=INF;
    		}
    	}
	/*CH *test=new CH();
	test->add(line(1,-1),1);
	test->add(line(1,-2),2);
	test->add(line(3,-3),3);
	test->print();*/
    	DP[0][0]=0;
	CH *C=new CH();
    	for(int parts=0;parts<=k;parts++){
    		/*for(int i=0;i<n;i++){
    			for(int j=i+1;j<=n;j++){
    				if(DP[j][parts+1]>DP[i][parts]+sq(acc[j]-acc[i])){
    					DP[j][parts+1]=DP[i][parts]+sq(acc[j]-acc[i]);
    					prev[j][parts+1]=i;
    				}
    			}
    		}*/
		for(int i=0;i<=n;i++){
			if(C->size()>0){
				/*cout<<i<<" "<<parts+1<<" "<<prev[i][parts+1]<<" "<<C->query(acc[i])<<endl;
				if(prev[i][parts+1]!=C->query(acc[i])){
					//C->print();
				}*/
				pre[i][parts+1]=C->query(acc[i]);
				DP[i][parts+1]=DP[pre[i][parts+1]][parts]+sq(acc[i]-acc[pre[i][parts+1]]);
			}
			if(DP[i][parts]!=INF){
				//cout<<i<<" "<<parts<<endl;
				C->add(line(sq(acc[i])+DP[i][parts],-2*acc[i]),i);
				//C->print();
				//cout<<endl;
			}
		}//cout<<endl;
		C->clear();
    	}
    	/*for(int parts=0;parts<=k+1;parts++){
    		for(int i=0;i<=n;i++){
    			printf("%d ",prev[i][parts]);
    		}printf("\n");
    	}*/
	/*for(int i=1;i<=k+1;i++){
		computeDP(0,n,i,0,n);
	}*/
    	lld ans=sq(acc[n])-DP[n][k+1];
    	ans/=2;
    	printf("%lld\n",ans);
	//cout<<ans<<endl;
    	int index=n;
    	int partition=k+1;
    	while(partition>0){
    		index=pre[index][partition];
    		partition--;
    		if(index>0){
			printf("%d ",index);
			//cout<<index<<" ";
		}
    	}//cout<<endl;
    	printf("\n");
     
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:81: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:86:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%lld",&arr[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 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 400 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 532 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 532 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 536 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 584 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 720 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 720 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 720 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 720 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 724 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 724 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 724 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 776 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 776 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 776 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1084 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 3 ms 1100 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 1104 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 1108 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 1124 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 1128 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 4 ms 1132 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 1136 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 3 ms 1172 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 1172 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3064 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 3068 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 16 ms 3072 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 3080 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 17 ms 3196 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 14 ms 3196 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 18 ms 3196 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 14 ms 3196 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 6 ms 3196 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 8 ms 3196 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24748 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 22 ms 24896 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 207 ms 24916 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 25 ms 24916 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 128 ms 25016 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 144 ms 25036 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 158 ms 25180 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 136 ms 25180 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 152 ms 25180 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 187 ms 25180 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 112 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -