oj.uz

Submission #12084

# Submission time Handle Problem Language Result Execution time Memory
12084 2014-12-21T00:08:22 Z tncks0121 Min-cost GCD (GA9_mcg) C++14
30 / 100
 205 ms 1084 KB 
#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)1e16;

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);
    if(a >= b) {
        return pll(
            min(min(last.first + p, last.second + mul(q, a/b)), INF),
            min(last.first + min(p + p, mul(q, (a/b))), INF)
        );
    }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.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 1084 KB Output is correct
2 Correct 78 ms 1084 KB Output is correct
3 Correct 78 ms 1084 KB Output is correct
4 Correct 82 ms 1084 KB Output is correct
5 Correct 68 ms 1084 KB Output is correct
6 Correct 83 ms 1084 KB Output is correct
7 Correct 83 ms 1084 KB Output is correct
8 Correct 81 ms 1084 KB Output is correct
9 Correct 82 ms 1084 KB Output is correct
10 Correct 77 ms 1084 KB Output is correct
11 Correct 86 ms 1084 KB Output is correct
12 Correct 78 ms 1084 KB Output is correct
13 Correct 43 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 1 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct

Subtask #3
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 205 ms 1084 KB Output isn't correct
2 Halted 0 ms 0 KB -