Submission #12223

#	Time	Username	Problem	Language	Result	Execution time	Memory
12223		paulsohn	Min-cost GCD (GA9_mcg)	C++98	30 / 100	127 ms	1108 KiB

mcg

#include<stdio.h>
#define min(a,b) (a<b?a:b)

long long a, b, p, q, Q[1000], DP[1000][2];
int T, cost;

int main(){
    int x, y, r;
    int i, s;
    scanf("%d", &T);
    while(T--){
        scanf("%lld %lld %lld %lld", &a, &b, &p, &q);

        x=(a>b?a:b);
        y=(a>b?b:a);
        i=0;
        do{
            r=x%y;
            Q[i]=x/y;
            x=y;
            y=r;
            i++;
        }while(r);
        s=i;

        if(a>=b){
            DP[0][0]=0;
            DP[0][1]=1000000000000000000;
        }
        else{
            DP[0][0]=p;
            DP[0][1]=0;
        }
        for(i=0; i<s; i++){
            DP[i+1][0]=min(DP[i][0]+p, DP[i][1]+Q[i]*q);
            DP[i+1][1]=DP[i][0]+Q[i]*q;
        }
        printf("%lld\n", min(DP[s][0], DP[s][1]));
    }
    return 0;
}

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