传送门
题目描述
给你一个序列 a i a_{i} ai和 b i b_{i} bi,你如果在 i i i点停留一天,可以或者 a i a_{i} ai单位的金钱,你如果想从 i i i点移动到 i + 1 i + 1 i+1 点,需要一天时间,并支付 a i a_{i} ai单位的金钱,为如果想或得 c c c单位的金枪,最少需要多少天
分析
先计算出,如果最后停留在 i i i点,前面最少需要花费多少天,然后循环最后停留的点,更新答案
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
ll a[N],b[N];
ll res[N];
ll p[N];
int n;
ll c;
int main(){
int T;
read(T);
while(T--){
read(n),read(c);
for(int i = 1;i <= n;i++) read(a[i]);
for(int i = 1;i < n;i++) read(b[i]);
res[1] = a[1];
p[1] = 1;
for(int i = 2;i <= n;i++){
p[i] = p[i - 1] + 1;
if(res[i - 1] >= b[i - 1]){
res[i] = res[i - 1] - b[i - 1];
continue;
}
ll t = b[i - 1] - res[i - 1];
ll q = t / a[i - 1];
if(t % a[i - 1]) q++;
p[i] += q;
res[i] = res[i - 1] + q * a[i - 1] - b[i - 1];
}
// for(int i = 1;i <= n;i++) cout << p[i] << ' ';
// puts("");
ll ans = 0x3f3f3f3f3f3f;
for(int i = 1;i <= n;i++){
if(res[i] >= c) {
ans = min(ans,p[i]);
// cout << i << ' ' << ans << endl;
continue;
}
ll t = c - res[i];
ll q = t / a[i];
if(t % a[i]) q++;
ans = min(ans,p[i] + q);
// cout << i << ' ' << ans << endl;
}
dl(ans);
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/