C. Petya and Exam Codeforces Round #610 (Div. 2)c （贪心）

C. Petya and Exam Codeforces Round #610 (Div. 2)c （贪心）

C. Petya and Exam

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya has come to the math exam and wants to solve as many problems as possible. He prepared and carefully studied the rules by which the exam passes.

The exam consists of nn problems that can be solved in TT minutes. Thus, the exam begins at time 00 and ends at time TT. Petya can leave the exam at any integer time from 00 to TT, inclusive.

All problems are divided into two types:

easy problems — Petya takes exactly aa minutes to solve any easy problem;
hard problems — Petya takes exactly bb minutes (b>ab>a) to solve any hard problem.
Thus, if Petya starts solving an easy problem at time xx, then it will be solved at time x+ax+a. Similarly, if at a time xx Petya starts to solve a hard problem, then it will be solved at time x+bx+b.

For every problem, Petya knows if it is easy or hard. Also, for each problem is determined time titi (0≤ti≤T0≤ti≤T) at which it will become mandatory (required). If Petya leaves the exam at time ss and there is such a problem ii that ti≤sti≤s and he didn’t solve it, then he will receive 00 points for the whole exam. Otherwise (i.e if he has solved all such problems for which ti≤sti≤s) he will receive a number of points equal to the number of solved problems. Note that leaving at time ss Petya can have both “mandatory” and “non-mandatory” problems solved.

For example, if n=2n=2, T=5T=5, a=2a=2, b=3b=3, the first problem is hard and t1=3t1=3 and the second problem is easy and t2=2t2=2. Then:

if he leaves at time s=0s=0, then he will receive 00 points since he will not have time to solve any problems;
if he leaves at time s=1s=1, he will receive 00 points since he will not have time to solve any problems;
if he leaves at time s=2s=2, then he can get a 11 point by solving the problem with the number 22 (it must be solved in the range from 00 to 22);
if he leaves at time s=3s=3, then he will receive 00 points since at this moment both problems will be mandatory, but he will not be able to solve both of them;
if he leaves at time s=4s=4, then he will receive 00 points since at this moment both problems will be mandatory, but he will not be able to solve both of them;
if he leaves at time s=5s=5, then he can get 22 points by solving all problems.
Thus, the answer to this test is 22.

Help Petya to determine the maximal number of points that he can receive, before leaving the exam.

Input

The first line contains the integer mm (1≤m≤1041≤m≤104) — the number of test cases in the test.

The next lines contain a description of mm test cases.

The first line of each test case contains four integers n,T,a,bn,T,a,b (2≤n≤2⋅1052≤n≤2⋅105, 1≤T≤1091≤T≤109, 1≤a<b≤1091≤a<b≤109) — the number of problems, minutes given for the exam and the time to solve an easy and hard problem, respectively.

The second line of each test case contains nn numbers 00 or 11, separated by single space: the ii-th number means the type of the ii-th problem. A value of 00 means that the problem is easy, and a value of 11 that the problem is hard.

The third line of each test case contains nn integers titi (0≤ti≤T0≤ti≤T), where the ii-th number means the time at which the ii-th problem will become mandatory.

It is guaranteed that the sum of nn for all test cases does not exceed 2⋅1052⋅105.

Output

Print the answers to mm test cases. For each set, print a single integer — maximal number of points that he can receive, before leaving the exam.

Example

input

Copy

10
3 5 1 3
0 0 1
2 1 4
2 5 2 3
1 0
3 2
1 20 2 4
0
16
6 20 2 5
1 1 0 1 0 0
0 8 2 9 11 6
4 16 3 6
1 0 1 1
8 3 5 6
6 20 3 6
0 1 0 0 1 0
20 11 3 20 16 17
7 17 1 6
1 1 0 1 0 0 0
1 7 0 11 10 15 10
6 17 2 6
0 0 1 0 0 1
7 6 3 7 10 12
5 17 2 5
1 1 1 1 0
17 11 10 6 4
1 1 1 2
0
1
output

Copy

3
2
1
0
1
4
0
1
2
1

题意：

给了n道题，T分钟。难题用时b分钟，简单题用时a分钟。并且每道题规定在$t_i$分钟及之前动笔。在没有开下一道题之前我们可以跑路。问我们可以最多做出多少题。

题解：

我们可以想到贪心，并且先完成限制时间小的题目。我们这里将两两题目之间解题分成一种情况，比如我们开了第三题则证明我们前两题是已经完成了的，这个时候我们只用考虑我们 在第三题和第四题之间这块时间我们可以完成多少道题目，因为想使每块时间最大利用，所以我们肯定先开简单题，然后剩下的时间再贪心做难题。

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+7;
struct Node
{
	int ishard,limit,time;
}pro[N];
int cmp(Node a,Node b)
{
	if(a.limit!=b.limit) return a.limit<b.limit;
}
signed main()
{
	int t; cin>>t;
	while(t--){
		int n,T,a,b,easy=0,hard=0; scanf("%lld%lld%lld%lld",&n,&T,&a,&b);
		for(int i=1;i<=n;i++){
			scanf("%lld",&pro[i].ishard);
			if(pro[i].ishard==1) hard++,pro[i].time=b;
			else easy++,pro[i].time=a;
		}
		for(int i=1;i<=n;i++) scanf("%lld",&pro[i].limit);
		pro[n+1].limit=T+1;
		sort(pro+1,pro+1+n,cmp);
		int sum=0,ans=0;
		for(int i=0;i<=n;i++){
			if(i!=0){
				sum+=pro[i].time;
				if(pro[i].ishard==1) hard--;
				else easy--;
			}
			if((pro[i].limit!=pro[i+1].limit||i==0||i==n)&&sum<=T&&sum<pro[i+1].limit){
				int res=pro[i+1].limit-sum-1;
				int num1=min(easy,res/a);
				res-=num1*a;
				int num2=min(hard,res/b);
				ans=max(ans,num1+num2+i);
			}
		}
		printf("%lld\n",ans);
	}
}