1082A - Vasya and Book - CodeForces Solution

#pragma GCC optimize(0)
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)

#include <iostream>
#include <map>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <cstring>

#define fi  first
#define se  second
#define endl "\n"
#define int long long
#define loop(i,a,b) for(int i = a;i <= b;i ++)
#define pool(i,a,b) for(int i = a;i >= b;i --)
using namespace std;
typedef pair<int,int> PII;
inline void YES(){cout << "YES" << endl;}
inline void NO(){cout << "NO" << endl;}

const int N = 2e5 + 5,M = 3e3 + 5,S = 1e6 + 7,Mod = 998244353;

void solve(){
    int n,x,y,d;
    cin >> n >> x >> y >> d;
    
    int ans = 1e18;
    int len = abs(x - y);
    
    //直接走
    if(len % d == 0) ans = min(ans,len / d);    
    //先走到1;
    if((y - 1) % d == 0) {
        ans = min(ans,(x + d - 2) / d + (y - 1) / d);
    }
    
    if((n - y) % d == 0) {
        ans = min(ans,(n - x + d - 1) / d + (n - y) / d);
    }
    
    if(ans == 1e18) ans = -1;
    cout << ans << endl;
}

signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int t = 1;
    cin >> t;
    
    while(t --){
        solve();
    }
    
    return 0;
}