Submission #12119

#	Time	Username	Problem	Language	Result	Execution time	Memory
12119		tncks0121	Min-cost GCD (GA9_mcg)	C++14	41 / 100	75 ms	32768 KiB

mcg

#pragma warning(disable:4996)
#include<stdio.h>
#include<algorithm>
#include <map>
using namespace std;
long long a, b, P, Q, C1, C2, TC1, TC2;
typedef long long ll;
const ll INF = (ll)1e18 + 5;
 
typedef pair<ll,ll> pll;
map<pll, ll> tmp[100005];
map<pll, ll> *ans;

ll mul (ll a, ll b) {
    if((double)INF / a < b) return INF;
    return a * b;
}
long long  gcd_cost_quite_fast (long long a, long long  b) {
    if(a == 0 || b == 0)return 0;
    if(ans->count(pll(a,b)) == 1) return (*ans)[pll(a,b)];
     
    long long ret = 0;
     
    if(a >= b) {
        //correct
        ret = gcd_cost_quite_fast(b, a%b) + P;
        ret = min(ret, gcd_cost_quite_fast(a%b, b) + mul(Q, a/b));
    }else {
        ret = gcd_cost_quite_fast(a, b%a) + min(P+P, mul(Q, (b/a)));
    }
     
    return (*ans)[pll(a,b)] = ret;
}
 
int main()
{
    int T;
    scanf("%d", &T);
    while (T--){
        scanf("%lld%lld", &a, &b);
        scanf("%lld%lld", &P, &Q);
        ans = tmp+T;//.clear();
        printf("%lld\n",gcd_cost_quite_fast(a, b));
    }
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 16
• Subtask 3: 27 / 27
• Subtask 4: 0 / 43