Submission #13301

#	Time	Username	Problem	Language	Result	Execution time	Memory
13301		tncks0121	Min-cost GCD (GA9_mcg)	C++14	100 / 100	210 ms	1084 KiB

mcg

#define _CRT_SECURE_NO_WARNINGS
 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
 
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
 
const ll INF = (ll)1e18 + 5;
 
ll mul (ll a, ll b) {
    if(a >= INF || b >= INF) return INF;
    if((double)INF / a < b) return INF;
    return a * b;
}
 
pll solve (ll a, ll b, ll p, ll q) {
    if(a * b == 0) return pll(0, 0);
     
    pll last = solve(b, a%b, p, q);
    // (b,a) = min((a,b)+p, (b,a%b)
  //   b <= a
    if(a >= b) {
        ll t = min(last.first + p, last.second + mul(q, a/b));
        ll v = min(t + p, last.first + mul(q, a/b));
        return pll(t, v);
    }else {
        return pll(last.second, last.first);
    }
     
}
 
int main() {
    int TC; scanf("%d", &TC);
    while(TC--) {
        ll a, b, p, q; scanf("%lld%lld%lld%lld", &a, &b, &p, &q);
        printf("%lld\n", solve(a, b, p, q).first);
    }
    return 0;
}

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