Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
54 lines (46 loc) · 1.18 KB

File metadata and controls

54 lines (46 loc) · 1.18 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <iostream>
using namespace std;
const int MAXN = 52;
double dis[MAXN], D;
double price[MAXN];
int K;
double ans;
const double INF = 99999999;
double mpg, cost_original, g_p;
bool dfs(double cur_dis, int cur_pos, double money, double gas){
if(cur_pos == K){
ans = min(ans, money);
return true;
}
cout<<"now at "<<cur_pos<<" money is "<<money<<" "<<gas<<endl;
for(int i=cur_pos+1; i<=K; i++){
if(gas*mpg>= dis[i] - cur_dis){
double gas_left = gas - (dis[i]-cur_dis)/mpg;
if(gas_left < g_p/2 || (gas_left>g_p/2 && i+1<=K-1 && gas_left*mpg<dis[i+1]-dis[i])){
dfs(dis[i], i, money+(g_p-gas)*price[i]+200, g_p);
}
/*
if(gas_left > g_p/2 ){
if((i+1<=K-1 && gas_left*mpg<dis[i+1]-dis[i])){
}
}
*/
}
}
}
void work(){
ans = INF;
dfs(0,-1, cost_original*100, g_p);
cout<<ans<<endl;
}
int main(){
while(cin>>D){
cin>>g_p>>mpg>>cost_original>>K;
for(int i=0; i<K; i++){
cin>>dis[i]>>price[i];
}
price[K] = 0, dis[K] = D;
work();
}
return 0;
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.