#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;
long long a,b,p,q;
std::map<long long, long long> chk;
long long go(long long a, long long b)
{
if (a == 0 || b == 0) return 0;
if (a == b) return p < q ? p : q;
long long h = a*b+a*3+b;
if (chk.count(h)) return chk[h];
long long &r = chk[h];
r = p + go(b,a%b);
if (a > b){
long long d = a / b, e = q * d;
if (q * d / d == q) r = min(r, e + go(a-b*d,b));
}
else{
long long d = b / a, e = q * d;
if (q * d / d == q) r = min(r, e + go(a,b-a*d));
}
return r;
}
int main()
{
int T; scanf ("%d",&T); while (T--){
scanf ("%lld %lld %lld %lld",&a,&b,&p,&q);
chk.clear();
printf ("%lld\n",go(a,b));
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
210 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
204 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
210 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
216 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
207 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
207 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
194 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
205 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
207 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
208 ms |
1212 KB |
Output is correct |
| 11 |
Correct |
200 ms |
1212 KB |
Output is correct |
| 12 |
Correct |
193 ms |
1212 KB |
Output is correct |
| 13 |
Correct |
206 ms |
1212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 15 |
Correct |
2 ms |
1212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
3 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
5 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
5 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
2 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
2 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
5 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1212 KB |
Output is correct |
| 11 |
Correct |
5 ms |
1212 KB |
Output is correct |
| 12 |
Correct |
6 ms |
1212 KB |
Output is correct |
| 13 |
Correct |
3 ms |
1212 KB |
Output is correct |
| 14 |
Correct |
3 ms |
1212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 16 |
Correct |
3 ms |
1212 KB |
Output is correct |
| 17 |
Correct |
2 ms |
1212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 19 |
Correct |
8 ms |
1212 KB |
Output is correct |
| 20 |
Correct |
3 ms |
1212 KB |
Output is correct |
| 21 |
Correct |
7 ms |
1212 KB |
Output is correct |
| 22 |
Correct |
8 ms |
1212 KB |
Output is correct |
| 23 |
Correct |
7 ms |
1212 KB |
Output is correct |
| 24 |
Correct |
7 ms |
1212 KB |
Output is correct |
| 25 |
Correct |
7 ms |
1212 KB |
Output is correct |
| 26 |
Correct |
6 ms |
1212 KB |
Output is correct |
| 27 |
Correct |
7 ms |
1212 KB |
Output is correct |
| 28 |
Correct |
6 ms |
1212 KB |
Output is correct |
| 29 |
Correct |
8 ms |
1212 KB |
Output is correct |
| 30 |
Correct |
8 ms |
1212 KB |
Output is correct |
| 31 |
Correct |
6 ms |
1212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1000 ms |
1212 KB |
Program timed out |
| 2 |
Halted |
0 ms |
0 KB |
- |
