只有#1#3#4AC，其他都是WA。30分。

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
struct jyz{
	double km,jg;
}a[55];
double l,k,y,u,minx;
int n;
double p(double oi){
	if(int(floor(oi/100))%10<5)return oi;
	else return oi+0.1;
}
void search_dfs(int node,double yuan,double yl){
	//cout<<node<<" "<<yuan<<" "<<yl<<endl;
	if(yl<0)return;
	if(node==n+1){
		minx=min(minx,yuan);
		return;
	}
	if(yl*2>l&&node!=1)return;
	for(int i=node+1;i<=n+1;i++){
		search_dfs(i,yuan+20+p(a[node].jg*(l-yl)),l-(a[i].km-a[node].km)/k);
	}
}
int main(){
	minx=14444400000000000;
	cin>>u;
	cin>>l>>k>>y;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].km>>a[i].jg;
	}
	a[n+1].km=u;
	search_dfs(1,y,l-a[1].km/k);
	printf("%.1lf",minx);
	return 0;
}