1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
ll tt,x,y,z,k,s;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>tt;
f(S,1,tt){
cin>>x>>y>>z>>k>>s;
if(x+y*s<k){
cout<<x+y*s<<"\n";
}else if(x-z*s>=k){
cout<<x-z*s<<"\n";
}
else {
ll mi=k-z,ma=k-1+y,l=0,r=s;
while(l<r){
ll mid=(l+r)>>1,tmp=x+mid*y-(s-mid)*z;
if(tmp>ma){
r=mid;
}else if(tmp<mi){
l=mid;
}else break;
}
ll mid=(l+r)>>1,tmp=x+mid*y-(s-mid)*z;
cout<<tmp<<"\n";
}
}
return 0;
}
|