Codeforces Round #379 (Div. 2)C

        C. Anton and Making Potions

        time limit per test4 seconds
        memory limit per test256 megabytes

Anton is playing a very interesting computer game, but now he is stuck at one of the levels. To pass to the next level he has to prepare n potions.

Anton has a special kettle, that can prepare one potions in x seconds. Also, he knows spells of two types that can faster the process of preparing potions.

Spells of this type speed up the preparation time of one potion. There are m spells of this type, the i-th of them costs bi manapoints and changes the preparation time of each potion to ai instead of x.
Spells of this type immediately prepare some number of potions. There are k such spells, the i-th of them costs di manapoints and instantly create ci potions.
Anton can use no more than one spell of the first type and no more than one spell of the second type, and the total number of manapoints spent should not exceed s. Consider that all spells are used instantly and right before Anton starts to prepare potions.

Anton wants to get to the next level as fast as possible, so he is interested in the minimum number of time he needs to spent in order to prepare at least n potions.

Input
The first line of the input contains three integers n, m, k (1 ≤ n ≤ 2·le9, 1 ≤ m, k ≤ 2·le5) — the number of potions, Anton has to make, the number of spells of the first type and the number of spells of the second type.

The second line of the input contains two integers x and s (2 ≤ x ≤ 2·le9, 1 ≤ s ≤ 2·le9) — the initial number of seconds required to prepare one potion and the number of manapoints Anton can use.

The third line contains m integers ai (1 ≤ ai < x) — the number of seconds it will take to prepare one potion if the i-th spell of the first type is used.

The fourth line contains m integers bi (1 ≤ bi ≤ 2·le9) — the number of manapoints to use the i-th spell of the first type.

There are k integers ci (1 ≤ ci ≤ n) in the fifth line — the number of potions that will be immediately created if the i-th spell of the second type is used. It’s guaranteed that ci are not decreasing, i.e. ci ≤ cj if i < j.

The sixth line contains k integers di (1 ≤ di ≤ 2·le9) — the number of manapoints required to use the i-th spell of the second type. It’s guaranteed that di are not decreasing, i.e. di ≤ dj if i < j.

Output
Print one integer — the minimum time one has to spent in order to prepare n potions.

Examples
input
20 3 2
10 99
2 4 3
20 10 40
4 15
10 80
output
20
input
20 3 2
10 99
2 4 3
200 100 400
4 15
100 800
output
200
Note
In the first sample, the optimum answer is to use the second spell of the first type that costs 10 manapoints. Thus, the preparation time of each potion changes to 4 seconds. Also, Anton should use the second spell of the second type to instantly prepare 15 potions spending 80 manapoints. The total number of manapoints used is 10 + 80 = 90, and the preparation time is 4·5 = 20 seconds (15 potions were prepared instantly, and the remaining 5 will take 4 seconds each).

题意：要制造n个药水，初始状态下制造药水的速度为x秒/个.
现有2种类型的技能可以制造药水；
1：消耗bi的mp，把制造速度变为ai
2:消耗di的mp，瞬间（不消耗时间）制造ci 个药水
每种技能至多只能用一次，在不超过蓝（mp）耗的情况下用最短的时间制造药水

思路：使用技能情况有3种
（1）：两种技能都不用
（2）：只用第一种技能或者只用第二种
（3）：两种技能都用

对于（2），只需要用O（n）时间，把满足蓝耗条件的最小time找出来
对于（3），逐个的用第一种技能与第二种技能匹配；
而题目在给出数据时给了一个条件，ci，di，是非递减的，说明在第二种技能中，蓝耗越高，瞬间产生的药水也会尽可能的多（非绝对），只需要二分查找出与ai组合蓝耗最高的 Cj。时间复杂度n*log（m）；

代码写的丑。。。
代码：

#include<iostream>
#include<cstdio>

using namespace std;
typedef long long LL;
struct p{
    LL abi;
    LL mp;

};

p a[200005];
p b[200005];
int main(){
    LL n,m,k;
    LL s,x;
scanf("%I64d %I64d %I64d",&n,&m,&k);
    scanf("%I64d %I64d",&x,&s);
    for(int i=0;i<m;i++){
        scanf("%I64d",&a[i].abi);

    } 
    for(int i=0;i<m;i++){
        scanf("%I64d",&a[i].mp);

    } 
    for(int i=0;i<k;i++){
    scanf("%I64d",&b[i].abi);
    }
        for(int i=0;i<k;i++){
    scanf("%I64d",&b[i].mp);
    }
    LL min;int flag1,flag2;
    min=n*x;
        long long minv=n*x;
    for(int i=0;i<k;i++){
if(b[i].mp<=s){
    minv=minv<(n-b[i].abi)*x?minv:(n-b[i].abi)*x;
}
    }
    min=min<minv?min:minv;
    for(int i=0;i<m;i++){
        LL temps=s;
flag1=flag2=1;
if(temps-a[i].mp<0)
flag1=0;
else
{
    temps-=a[i].mp;

}
LL ab=0;
int l=0;
int r=k-1;
int flag3=0;
    if(b[k-1].mp<=temps){
        ab=b[k-1].abi;
        flag3=1;


    }
    else if(b[0].mp>temps){
        flag2=0;
    }
while(l<=r){
if(flag2==0||flag3==1)
break;

    int mid=(l+r)/2;
    if((b[mid].mp<=temps&&b[mid+1].mp>temps)&&(mid+1)<=r){
        ab=b[mid].abi;break; 
    }
    if(b[mid].mp<=temps&&b[mid+1].mp<=temps&&(mid+1)<=r){
        l=mid;
        continue; 
    }
//  if(b[mid].mp>temps)
else{
        r=mid;
        continue;
    }
}
LL tmin;
if(flag1==0&&ab==0){
    continue;
}
else if(flag1==0&&ab!=0){
//  cout<<"ab"<<ab<<endl;
    tmin=(n-ab)*x;

}
else if(flag1==1&&ab!=0){
    //cout<<ab<<" "<<a[i].abi<<"a "<<endl;
    tmin=(n-ab)*a[i].abi;
}
else if(flag1==1&&ab==0){
    //cout<<a[i].abi<<"a"<<endl;
    tmin=n*a[i].abi;
}
    min=min<tmin?min:tmin;  
//  cout<<i<<" "<<endl;
    }
    printf("%I64d\n",min);
    return 0;
} 

【1】http://codeforces.com/contest/734/problem/C