传送门
题意
分析
分情况讨论一下
如果
y
<
x
y < x
y<x,那么无论我加不加水,水量都是呈递减趋势,所以我们假设每一天都加水,判断最后一天是否符合条件即可,需要注意的是,有可能第一天加水会超过
r
r
r
剩下的情况就考虑什么到达了最低水位,这个时候去补水就可以了,可以判断一下余数,记忆化搜索
代码
#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 k, l, r, t, x, y;
map<ll, int> M;
int main() {
cin >> k >> l >> r >> t >> x >> y;
if (y < x) {
if (k + y > r) t--, k -= x;
if (k < l) return puts("No"), 0;
ll p = (k - l) / (x - y);
if (p >= t)return cout << "Yes", 0;
else return cout << "No", 0;
}
else {
while (t) {
if (M[k % x]) return puts("Yes"), 0;
ll p = min((k - l) / x, t);
t -= p;
if (t <= 0) break;
k -= p * x;
M[k % x] = true;
k += y;
if (k > r || k < l) return puts("No"), 0;
}
return puts("Yes"), 0;
}
}