답안 #12107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
12107	2014-12-21T07:11:20 Z	kriii	Min-cost GCD (GA9_mcg)	C++14	57 / 100	1000 ms	1212 KB

mcg

#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)];
	r = p + go(b,a%b);
	if (a > b){
		long long d = a / b, e = q * d;
		if (e / d == q) r = min(r, e + go(a-b*d,b));
	}
	else{
		long long d = b / a, e = q * d;
		if (e / 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;
}

Subtask #1

14.0 / 14.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

Subtask #2

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	206 ms	1212 KB	Output is correct
2	Correct	223 ms	1212 KB	Output is correct
3	Correct	221 ms	1212 KB	Output is correct
4	Correct	211 ms	1212 KB	Output is correct
5	Correct	215 ms	1212 KB	Output is correct
6	Correct	204 ms	1212 KB	Output is correct
7	Correct	216 ms	1212 KB	Output is correct
8	Correct	212 ms	1212 KB	Output is correct
9	Correct	228 ms	1212 KB	Output is correct
10	Correct	219 ms	1212 KB	Output is correct
11	Correct	212 ms	1212 KB	Output is correct
12	Correct	214 ms	1212 KB	Output is correct
13	Correct	220 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	0 ms	1212 KB	Output is correct
17	Correct	1 ms	1212 KB	Output is correct

Subtask #3

27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	1212 KB	Output is correct
2	Correct	7 ms	1212 KB	Output is correct
3	Correct	4 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	6 ms	1212 KB	Output is correct
7	Correct	6 ms	1212 KB	Output is correct
8	Correct	7 ms	1212 KB	Output is correct
9	Correct	7 ms	1212 KB	Output is correct
10	Correct	4 ms	1212 KB	Output is correct
11	Correct	4 ms	1212 KB	Output is correct
12	Correct	7 ms	1212 KB	Output is correct
13	Correct	4 ms	1212 KB	Output is correct
14	Correct	0 ms	1212 KB	Output is correct
15	Correct	0 ms	1212 KB	Output is correct
16	Correct	0 ms	1212 KB	Output is correct
17	Correct	0 ms	1212 KB	Output is correct
18	Correct	3 ms	1212 KB	Output is correct
19	Correct	7 ms	1212 KB	Output is correct
20	Correct	9 ms	1212 KB	Output is correct
21	Correct	8 ms	1212 KB	Output is correct
22	Correct	6 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	6 ms	1212 KB	Output is correct
26	Correct	6 ms	1212 KB	Output is correct
27	Correct	8 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	8 ms	1212 KB	Output is correct

Subtask #4

0.0 / 43.0

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