#include <map>
#include <cstdio>
#include <algorithm>
using namespace std;
map<pair<long long, long long>, long long> dp;
long long a, b, p, q;
const long long INF = 1000000ll * 1000000ll * 500000ll;
long long getAns(long long a, long long b)
{
if(a == 0 || b == 0) return 0;
pair<long long, long long> cur = make_pair(a, b);
if(dp.count(cur)) return dp[cur];
long long ret = p + getAns(b, a % b);
if(a >= b)
{
long long howMany = a / b;
if(howMany <= ret / q + 1)
{
long long cand = howMany * q + getAns(a % b, b);
ret = min(cand, ret);
}
}
else
{
long long howMany = b / a;
if(howMany <= ret / q + 1)
{
long long cand = howMany * q + getAns(a, b % a);
ret = min(cand, ret);
}
}
return dp[cur] = ret;
}
int main(void)
{
int T;
scanf("%d", &T);
while(T--)
{
scanf("%lld %lld %lld %lld", &a, &b, &p, &q);
dp.clear();
printf("%lld\n", getAns(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 |
172 ms |
1212 KB |
Output is correct |
2 |
Correct |
206 ms |
1212 KB |
Output is correct |
3 |
Correct |
204 ms |
1212 KB |
Output is correct |
4 |
Correct |
206 ms |
1212 KB |
Output is correct |
5 |
Correct |
171 ms |
1212 KB |
Output is correct |
6 |
Correct |
206 ms |
1212 KB |
Output is correct |
7 |
Correct |
208 ms |
1212 KB |
Output is correct |
8 |
Correct |
180 ms |
1212 KB |
Output is correct |
9 |
Correct |
204 ms |
1212 KB |
Output is correct |
10 |
Correct |
187 ms |
1212 KB |
Output is correct |
11 |
Correct |
201 ms |
1212 KB |
Output is correct |
12 |
Correct |
168 ms |
1212 KB |
Output is correct |
13 |
Correct |
191 ms |
1212 KB |
Output is correct |
14 |
Correct |
2 ms |
1212 KB |
Output is correct |
15 |
Correct |
2 ms |
1212 KB |
Output is correct |
16 |
Correct |
2 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 |
6 ms |
1212 KB |
Output is correct |
3 |
Correct |
5 ms |
1212 KB |
Output is correct |
4 |
Correct |
4 ms |
1212 KB |
Output is correct |
5 |
Correct |
6 ms |
1212 KB |
Output is correct |
6 |
Correct |
4 ms |
1212 KB |
Output is correct |
7 |
Correct |
5 ms |
1212 KB |
Output is correct |
8 |
Correct |
6 ms |
1212 KB |
Output is correct |
9 |
Correct |
4 ms |
1212 KB |
Output is correct |
10 |
Correct |
5 ms |
1212 KB |
Output is correct |
11 |
Correct |
6 ms |
1212 KB |
Output is correct |
12 |
Correct |
4 ms |
1212 KB |
Output is correct |
13 |
Correct |
5 ms |
1212 KB |
Output is correct |
14 |
Correct |
2 ms |
1212 KB |
Output is correct |
15 |
Correct |
0 ms |
1212 KB |
Output is correct |
16 |
Correct |
2 ms |
1212 KB |
Output is correct |
17 |
Correct |
0 ms |
1212 KB |
Output is correct |
18 |
Correct |
2 ms |
1212 KB |
Output is correct |
19 |
Correct |
7 ms |
1212 KB |
Output is correct |
20 |
Correct |
5 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 |
8 ms |
1212 KB |
Output is correct |
24 |
Correct |
7 ms |
1212 KB |
Output is correct |
25 |
Correct |
0 ms |
1212 KB |
Output is correct |
26 |
Correct |
5 ms |
1212 KB |
Output is correct |
27 |
Correct |
7 ms |
1212 KB |
Output is correct |
28 |
Correct |
7 ms |
1212 KB |
Output is correct |
29 |
Correct |
7 ms |
1212 KB |
Output is correct |
30 |
Correct |
7 ms |
1212 KB |
Output is correct |
31 |
Correct |
5 ms |
1212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
936 ms |
1212 KB |
Output is correct |
2 |
Correct |
947 ms |
1212 KB |
Output is correct |
3 |
Correct |
938 ms |
1212 KB |
Output is correct |
4 |
Correct |
951 ms |
1212 KB |
Output is correct |
5 |
Correct |
945 ms |
1212 KB |
Output is correct |
6 |
Correct |
928 ms |
1212 KB |
Output is correct |
7 |
Correct |
947 ms |
1212 KB |
Output is correct |
8 |
Correct |
933 ms |
1212 KB |
Output is correct |
9 |
Correct |
951 ms |
1212 KB |
Output is correct |
10 |
Correct |
938 ms |
1212 KB |
Output is correct |
11 |
Correct |
938 ms |
1212 KB |
Output is correct |
12 |
Correct |
940 ms |
1212 KB |
Output is correct |
13 |
Correct |
940 ms |
1212 KB |
Output is correct |
14 |
Execution timed out |
1000 ms |
1212 KB |
Program timed out |
15 |
Halted |
0 ms |
0 KB |
- |