oj.uz

Submission #783656

# Submission time Handle Problem Language Result Execution time Memory
783656 2023-07-15T07:37:00 Z kshitij_sodani Long Distance Coach (JOI17_coach) C++14
71 / 100
 107 ms 17776 KB 
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;
#define endl '\n'


llo it[200001];
llo dp[200001];
llo xx[200001];
llo pre[200001];
llo pre2[200001];
pair<llo,llo> sect(pair<llo,llo> aa,pair<llo,llo> bb){
	pair<llo,llo> zz={bb.b-aa.b,aa.a-bb.a};
	if(zz.b<0){
		zz.b=-zz.b;
		zz.a=-zz.a;
	}
	return zz;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo x,n,m,w,t;
	cin>>x>>n>>m>>w>>t;
	vector<pair<pair<llo,llo>,llo>> ss;
	llo ans=((x/t)+1)*w;
	for(llo i=0;i<n;i++){
		cin>>it[i];
		ss.pb({{it[i]%t,-1},it[i]/t});
	}
	ss.pb({{x%t,-1},x/t});
	for(llo i=0;i<m;i++){
		llo aa,bb;
		cin>>aa>>bb;
		if((aa)<(x%t)){
			ans+=((x/t)*w)+w;
			xx[i]=(x/t);
		}
		else{
			ans+=(((x/t))*w);
			xx[i]=(x/t)-1;
		}
		ss.pb({{aa,xx[i]},bb});
	}
	//cout<<ans<<endl;
	sort(ss.begin(),ss.end());
	dp[0]=0;
	llo ma=0;
	/*for(auto j:ss){
		cout<<j.a.a<<":"<<j.a.b<<":"<<j.b<<endl;
	}*/
	pre[0]=0;
	pre2[0]=0;
	for(int i=0;i<ss.size();i++){
		pre[i+1]=pre[i];
		pre2[i+1]=pre2[i];
		if(ss[i].a.b>=0){
			pre[i+1]+=ss[i].b;
			pre[i+1]-=w*ss[i].a.b;
			pre2[i+1]=pre2[i]+1;
		}
	}
	vector<pair<llo,llo>> ss2;
	vector<pair<llo,llo>> tt;
	for(llo i=0;i<ss.size();i++){
		dp[i+1]=dp[i];
		if(ss[i].a.b>=0){
			pair<llo,llo> cur={-w*pre2[i],-pre[i]-dp[i]};
			while(ss2.size()>=2){
				pair<llo,llo> aa=sect(ss2[ss2.size()-2],ss2.back());
				pair<llo,llo> bb=sect(ss2[ss2.size()-2],cur);
				__int128 xx=(__int128)aa.b*(__int128)bb.a;
				__int128 yy=(__int128)bb.b*(__int128)aa.a;
				if(xx<=yy){
					ss2.pop_back();
					tt.pop_back();
				}
				else{
					break;
				}
				//check if bb<aa
			}
			if(ss2.size()){
				tt.pb(sect(ss2.back(),cur));
			}
			ss2.pb(cur);
		}
		if(ss[i].a.b==-1){
			//llo su=0;
		/*	llo ma=1e18;
			for(auto jj:ss2){
				ma=min(ma,jj.a*(ss[i].b-1)+jj.b);
			}*/
			
			//query for lowest intersection below ss[i].b-1
			llo low=0;
			pair<llo,llo> aa={ss[i].b-1,1};
			for(int j=19;j>=0;j--){
				if(low+(1<<j)<tt.size()){
					pair<llo,llo> bb=tt[low+(1<<j)];
					__int128 xx=(__int128)aa.b*(__int128)bb.a;
					__int128 yy=(__int128)bb.b*(__int128)aa.a;
					if(xx<=yy){
						low+=(1<<j);
					}
					else{
					}
				}
			}
		/*	for(auto j:tt){
			    cout<<j.a<<":"<<j.b<<endl;
			}
			cout<<endl;*/
			for(int j=low-2;j<=low+2;j++){
				if(j<0 or j>=ss2.size()){
					continue;
				}
				ma=min(ma,ss2[j].a*(ss[i].b-1)+ss2[j].b);
			}
			

			dp[i+1]=max(dp[i+1],-ma+(-ss[i].b+1)*pre2[i+1]*w-pre[i+1]);
			/*for(llo j=i-1;j>=0;j--){
				
				llo su=-w*pre2[j]*(-ss[i].b+1);
				//query max here

				pair<llo,llo> cur={-w*pre2[j],-pre[j]-dp[j]};
				//query is (ss[i].b-1)


				//slope is -ss[i].b+1
				//number of type 0 in prefix
				//dp[i+1]=max(dp[i+1],-cot+(-ss[i].b+1)*pre2[i+1]*w-pre[i+1]);

				//dp[i+1]=max(dp[i+1],dp[j]+su+(-ss[i].b+1)*pre2[i+1]*w+pre[j]-pre[i+1]);
			}*/
		}
		ma=max(ma,dp[i+1]);
		//cout<<dp[i+1]<<",";
	}
	//cout<<endl;
	ans-=ma;
	cout<<ans<<endl;
	






	return 0;
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i=0;i<ss.size();i++){
      |              ~^~~~~~~~~~
coach.cpp:68:15: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  for(llo i=0;i<ss.size();i++){
      |              ~^~~~~~~~~~
coach.cpp:102:18: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     if(low+(1<<j)<tt.size()){
      |        ~~~~~~~~~~^~~~~~~~~~
coach.cpp:118:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |     if(j<0 or j>=ss2.size()){
      |               ~^~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 324 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 324 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 664 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 684 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 724 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 1 ms 664 KB Output is correct
50 Correct 2 ms 664 KB Output is correct
51 Correct 1 ms 596 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 324 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 664 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 684 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 724 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 1 ms 664 KB Output is correct
50 Correct 2 ms 664 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Incorrect 107 ms 17776 KB Output isn't correct
53 Halted 0 ms 0 KB -