题意:
有n个职位,每个职位一天可以拿到工资为a[i],通过花费b[i]的钱 + 一天可以到下一个职位,问最少多少天可以买价值为c的电脑;
思路:
直接暴力加构造,每个职位遍历一次,算出当前职位不晋升能买到电脑的天数,然后取一个最小值即可;
代码:
#include <iostream>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <queue>
#include <utility>
#include <stack>
#define mes memset
#define mec memcpy
using namespace std;
typedef long long ll;
typedef pair<int,int>PII;
const int N = 200010;
const int null = 0x3f3f3f3f;
const ll mod = 1000000007;
int T;
ll n,c;
ll a[N];
ll b[N];
int main()
{
cin >> T;
while(T --)
{
cin >> n >> c;
for(int i = 1;i <= n;i ++) cin >> a[i];
for(int i = 1;i < n;i ++) cin >> b[i];
ll day = 0,lomo = 0,ans = 1e18;
for(int i = 1;i <= n;i ++)
{
if(a[i] != 1)
{
ans = min(ans,day + (ll)ceil((c - lomo) * 1.0 / a[i]));
ll x = ceil((b[i] - lomo) * 1.0 / a[i]);
day += x;
lomo += a[i] * x - b[i];
day ++;
}
else
{
ans = min(ans,day + (c - lomo) / a[i]);
ll x = (b[i] - lomo) / a[i];
day += x;
lomo += a[i] * x - b[i];
day ++;
}
// if(lomo < 0) lomo += a[i],day ++;
// cout << day << " " << lomo << " " << ans << endl;
}
cout << ans << endl;
}
return 0;
}