| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 12103 |
2014-12-21T06:57:04 Z |
kriii |
Min-cost GCD (GA9_mcg) |
C++14 |
|
1000 ms |
1212 KB |
#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;
long long a,b,p,q;
std::map<pair<long long, 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;
if (chk.count(make_pair(a,b))) return chk[make_pair(a,b)];
long long &r = chk[make_pair(a,b)];
if (a > b){
long long d = a / b;
r = p + go(b,a%b);
r = min(r, p * 2 + go(a%b,b));
r = min(r, q * d + go(a-b*d,b));
}
else{
long long d = b / a;
r = p * 2 + go(a,b%a);
r = min(r, q * d + 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;
}
| # |
Verdict |
Execution time |
Memory |
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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
197 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
198 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
205 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
196 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
191 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
195 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
194 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
198 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
197 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
183 ms |
1212 KB |
Output is correct |
| 11 |
Correct |
199 ms |
1212 KB |
Output is correct |
| 12 |
Correct |
197 ms |
1212 KB |
Output is correct |
| 13 |
Correct |
198 ms |
1212 KB |
Output is correct |
| 14 |
Correct |
1 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 |
2 ms |
1212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1212 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
1212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1000 ms |
1212 KB |
Program timed out |
| 2 |
Halted |
0 ms |
0 KB |
- |
