【每日一题】打卡 47

原题链接：https://codeforces.com/contest/1759/problem/C

题意：有一个温度计，现在显示的温度是 b ，现在希望把他调整到 a 。但是每次调整，都只能把当前温度示数调整到距离当前温度 ≥x 的数字上。温度计的示数最低为 l ，最高为 r 。问想要调整过去，最少要几步，如果说完全不能调整过去，就输出 −1。 

分类讨论即可。

#define _CRT_SECURE_NO_WARNINGS 1
#include <math.h>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define FOR(a, b) for (int i = a; i <= b; i++)
#define ROF(a, b) for (int i = a; i >= b; i--)
#define FORj(a, b) for (int j = a; j <= b; j++)
#define ROFj(a, b) for (int j = a; j >= b; j--)
#define FORk(a, b) for (int k = a; k <= b; k++)
#define ROFk(a, b) for (int k = a; k >= b; k--)
#define mem(i, a) memset(i, a, sizeof(i))
#define ll long long
#define inf 0x3f3f3f3f
#define PII pair<int, int>
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define int long long
#define endl '\n'
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define pi acos(-1.0)
using namespace std;
const int maxn = 2e6 + 5;
void solve() {
	int l, r, x, a, b;
	cin >> l >> r >> x >> a >> b;
	if (a == b) cout << 0 << endl;
	else if (abs(l-r)<x) cout << -1 << endl;
	else if (abs(a-b)>=x) cout << 1 << endl;
	else if(b>a) {
		if(b+x<=r||a-x>=l) 	cout << 2 << endl;
		else if (a+x<=r&&b-x>=l) cout<<3<<endl;
		else cout << -1 << endl;
	} else if(a>b) {
		if(b-x>=l||a+x<=r) 	cout << 2 << endl;
		else if (a-x>=l&&b+x<=r) cout<<3<<endl;
		else cout << -1 << endl;
	}
}
signed main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);
	int _;
	cin >> _;
	while (_--)
		solve();
	return 0;
}