답안 #12162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
12162	2014-12-21T12:47:10 Z	xhae	Min-cost GCD (GA9_mcg)	C++14	57 / 100	1000 ms	1580 KB

mcg

#include <unordered_map>
#include <cstdio>
#include <algorithm>

using namespace std;

class llhash
{
	public:
		size_t operator()(const pair<long long, long long>& x) const
		{
			size_t h = (x.first << 48) | ((x.second << 48) >> 48);
			return h;
		}
};

unordered_map<pair<long long, long long>, long long, llhash> 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 / (double)q)
        {
            long long cand = howMany * q + getAns(a % b, b);
            ret = min(cand, ret);
        }
    }
    else
    {
        long long howMany = b / a;
        if(howMany <= ret / (double)q)
        {
            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;
}

Subtask #1

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1580 KB	Output is correct
2	Correct	0 ms	1580 KB	Output is correct
3	Correct	0 ms	1580 KB	Output is correct
4	Correct	0 ms	1580 KB	Output is correct
5	Correct	0 ms	1580 KB	Output is correct
6	Correct	0 ms	1580 KB	Output is correct
7	Correct	0 ms	1580 KB	Output is correct
8	Correct	0 ms	1580 KB	Output is correct
9	Correct	0 ms	1580 KB	Output is correct
10	Correct	0 ms	1580 KB	Output is correct

Subtask #2

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	149 ms	1580 KB	Output is correct
2	Correct	225 ms	1580 KB	Output is correct
3	Correct	231 ms	1580 KB	Output is correct
4	Correct	251 ms	1580 KB	Output is correct
5	Correct	135 ms	1580 KB	Output is correct
6	Correct	249 ms	1580 KB	Output is correct
7	Correct	251 ms	1580 KB	Output is correct
8	Correct	160 ms	1580 KB	Output is correct
9	Correct	247 ms	1580 KB	Output is correct
10	Correct	181 ms	1580 KB	Output is correct
11	Correct	229 ms	1580 KB	Output is correct
12	Correct	141 ms	1580 KB	Output is correct
13	Correct	209 ms	1580 KB	Output is correct
14	Correct	3 ms	1580 KB	Output is correct
15	Correct	2 ms	1580 KB	Output is correct
16	Correct	2 ms	1580 KB	Output is correct
17	Correct	2 ms	1580 KB	Output is correct

Subtask #3

27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	1580 KB	Output is correct
2	Correct	0 ms	1580 KB	Output is correct
3	Correct	0 ms	1580 KB	Output is correct
4	Correct	4 ms	1580 KB	Output is correct
5	Correct	5 ms	1580 KB	Output is correct
6	Correct	8 ms	1580 KB	Output is correct
7	Correct	6 ms	1580 KB	Output is correct
8	Correct	7 ms	1580 KB	Output is correct
9	Correct	5 ms	1580 KB	Output is correct
10	Correct	7 ms	1580 KB	Output is correct
11	Correct	6 ms	1580 KB	Output is correct
12	Correct	7 ms	1580 KB	Output is correct
13	Correct	7 ms	1580 KB	Output is correct
14	Correct	0 ms	1580 KB	Output is correct
15	Correct	0 ms	1580 KB	Output is correct
16	Correct	0 ms	1580 KB	Output is correct
17	Correct	0 ms	1580 KB	Output is correct
18	Correct	0 ms	1580 KB	Output is correct
19	Correct	7 ms	1580 KB	Output is correct
20	Correct	8 ms	1580 KB	Output is correct
21	Correct	7 ms	1580 KB	Output is correct
22	Correct	9 ms	1580 KB	Output is correct
23	Correct	6 ms	1580 KB	Output is correct
24	Correct	6 ms	1580 KB	Output is correct
25	Correct	5 ms	1580 KB	Output is correct
26	Correct	9 ms	1580 KB	Output is correct
27	Correct	7 ms	1580 KB	Output is correct
28	Correct	7 ms	1580 KB	Output is correct
29	Correct	8 ms	1580 KB	Output is correct
30	Correct	9 ms	1580 KB	Output is correct
31	Correct	7 ms	1580 KB	Output is correct

Subtask #4

0.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1000 ms	1580 KB	Program timed out
2	Halted	0 ms	0 KB	-