#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX = 70;
const ll INF = 1234567890123456789LL;
ll p, q, memo[MAX][2];
ll minGcd(ll a, ll b, int level){
if(a == 0 || b == 0) return 0;
ll &now = a >= b ? memo[level][0] : memo[level][1];
if(now != 0) return now;
if(a >= b){
now = minGcd(b, a%b, level+1)+p;
ll count = (a - (a%b))/b;
if((INF - minGcd(a%b, b, level+1))/count > q)
now = min(now, minGcd(a%b, b, level+1) + q*count);
} else {
now = minGcd(b, a, level)+p;
ll count = (b - (b%a))/a;
if((INF - minGcd(a, b%a, level+1))/count > q)
now = min(now, minGcd(a, b%a, level+1) + q*count);
}
return now;
}
void reset(){
for(int i = 0; i < MAX; i++)
memo[i][0] = memo[i][1] = 0;
}
int main(){
int t;
for(scanf("%d", &t); t--;){
ll a, b;
scanf("%lld%lld%lld%lld", &a, &b, &p, &q);
printf("%lld\n", minGcd(a, b, 0));
reset();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Correct |
0 ms |
1084 KB |
Output is correct |
7 |
Correct |
0 ms |
1084 KB |
Output is correct |
8 |
Correct |
0 ms |
1084 KB |
Output is correct |
9 |
Correct |
0 ms |
1084 KB |
Output is correct |
10 |
Correct |
0 ms |
1084 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
130 ms |
1084 KB |
Output is correct |
2 |
Correct |
141 ms |
1084 KB |
Output is correct |
3 |
Correct |
145 ms |
1084 KB |
Output is correct |
4 |
Correct |
136 ms |
1084 KB |
Output is correct |
5 |
Correct |
133 ms |
1084 KB |
Output is correct |
6 |
Correct |
145 ms |
1084 KB |
Output is correct |
7 |
Correct |
142 ms |
1084 KB |
Output is correct |
8 |
Correct |
137 ms |
1084 KB |
Output is correct |
9 |
Correct |
143 ms |
1084 KB |
Output is correct |
10 |
Correct |
135 ms |
1084 KB |
Output is correct |
11 |
Correct |
143 ms |
1084 KB |
Output is correct |
12 |
Correct |
134 ms |
1084 KB |
Output is correct |
13 |
Correct |
139 ms |
1084 KB |
Output is correct |
14 |
Correct |
0 ms |
1084 KB |
Output is correct |
15 |
Correct |
0 ms |
1084 KB |
Output is correct |
16 |
Correct |
0 ms |
1084 KB |
Output is correct |
17 |
Correct |
1 ms |
1084 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
1084 KB |
Output is correct |
2 |
Correct |
3 ms |
1084 KB |
Output is correct |
3 |
Correct |
3 ms |
1084 KB |
Output is correct |
4 |
Correct |
3 ms |
1084 KB |
Output is correct |
5 |
Correct |
2 ms |
1084 KB |
Output is correct |
6 |
Correct |
3 ms |
1084 KB |
Output is correct |
7 |
Correct |
2 ms |
1084 KB |
Output is correct |
8 |
Correct |
3 ms |
1084 KB |
Output is correct |
9 |
Correct |
3 ms |
1084 KB |
Output is correct |
10 |
Correct |
2 ms |
1084 KB |
Output is correct |
11 |
Correct |
0 ms |
1084 KB |
Output is correct |
12 |
Correct |
3 ms |
1084 KB |
Output is correct |
13 |
Correct |
3 ms |
1084 KB |
Output is correct |
14 |
Correct |
0 ms |
1084 KB |
Output is correct |
15 |
Correct |
1 ms |
1084 KB |
Output is correct |
16 |
Correct |
1 ms |
1084 KB |
Output is correct |
17 |
Correct |
0 ms |
1084 KB |
Output is correct |
18 |
Correct |
0 ms |
1084 KB |
Output is correct |
19 |
Correct |
4 ms |
1084 KB |
Output is correct |
20 |
Correct |
4 ms |
1084 KB |
Output is correct |
21 |
Correct |
2 ms |
1084 KB |
Output is correct |
22 |
Correct |
3 ms |
1084 KB |
Output is correct |
23 |
Correct |
4 ms |
1084 KB |
Output is correct |
24 |
Correct |
4 ms |
1084 KB |
Output is correct |
25 |
Correct |
4 ms |
1084 KB |
Output is correct |
26 |
Correct |
4 ms |
1084 KB |
Output is correct |
27 |
Correct |
4 ms |
1084 KB |
Output is correct |
28 |
Correct |
2 ms |
1084 KB |
Output is correct |
29 |
Correct |
3 ms |
1084 KB |
Output is correct |
30 |
Correct |
2 ms |
1084 KB |
Output is correct |
31 |
Correct |
2 ms |
1084 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
493 ms |
1084 KB |
Output is correct |
2 |
Correct |
490 ms |
1084 KB |
Output is correct |
3 |
Correct |
495 ms |
1084 KB |
Output is correct |
4 |
Correct |
511 ms |
1084 KB |
Output is correct |
5 |
Correct |
518 ms |
1084 KB |
Output is correct |
6 |
Correct |
493 ms |
1084 KB |
Output is correct |
7 |
Correct |
510 ms |
1084 KB |
Output is correct |
8 |
Correct |
506 ms |
1084 KB |
Output is correct |
9 |
Correct |
512 ms |
1084 KB |
Output is correct |
10 |
Correct |
503 ms |
1084 KB |
Output is correct |
11 |
Correct |
502 ms |
1084 KB |
Output is correct |
12 |
Correct |
500 ms |
1084 KB |
Output is correct |
13 |
Correct |
543 ms |
1084 KB |
Output is correct |
14 |
Incorrect |
593 ms |
1084 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |