Submission #12104

#	Time	Username	Problem	Language	Result	Execution time	Memory
12104		gs14004	Min-cost GCD (GA9_mcg)	C++98	14 / 100	1000 ms	1196 KiB

mcg

#include <cstdio>
#include <cmath>
typedef long long lint;

lint a,b,p,q;

bool calc_valid(lint x, lint y){
    double t = log10(x)+log10(y);
    return t < 17;
}

lint f(lint x, lint y){
    if(x == 0 || y == 0) return 0;
    lint c1 = f(y,x%y) + p; // 결코 답안은 10^17을 넘지 않는다
    lint c2;
    if(x >= y){
        if(!calc_valid(q,x/y)) return c1;
        else c2 = f(x%y,y) + q*(x/y);
    }
    else{
        if(!calc_valid(q,y/x)) return c1;
        else c2 = f(x,y%x) + q*(y/x);
    }
    return c1 < c2 ? c1 : c2;
}

void solve(){
    scanf("%lld %lld %lld %lld",&a,&b,&p,&q);
    printf("%lld\n",f(a,b));
}

int main(){
    int t;
    scanf("%d",&t);
    while (t--) {
        solve();
    }
}

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