oj.uz

Submission #12083

# Submission time Handle Problem Language Result Execution time Memory
12083 2014-12-20T23:57:55 Z tncks0121 Min-cost GCD (GA9_mcg) C++14
100 / 100
 253 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(last.first + p, last.second + mul(q, a/b)),
            last.first + min(p + p, mul(q, (a/b)))
        );
    }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 72 ms 1084 KB Output is correct
2 Correct 78 ms 1084 KB Output is correct
3 Correct 94 ms 1084 KB Output is correct
4 Correct 71 ms 1084 KB Output is correct
5 Correct 53 ms 1084 KB Output is correct
6 Correct 67 ms 1084 KB Output is correct
7 Correct 77 ms 1084 KB Output is correct
8 Correct 74 ms 1084 KB Output is correct
9 Correct 64 ms 1084 KB Output is correct
10 Correct 76 ms 1084 KB Output is correct
11 Correct 47 ms 1084 KB Output is correct
12 Correct 42 ms 1084 KB Output is correct
13 Correct 74 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
27.0 / 27.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 2 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 1 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 1 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 1 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct
21 Correct 0 ms 1084 KB Output is correct
22 Correct 0 ms 1084 KB Output is correct
23 Correct 0 ms 1084 KB Output is correct
24 Correct 2 ms 1084 KB Output is correct
25 Correct 0 ms 1084 KB Output is correct
26 Correct 0 ms 1084 KB Output is correct
27 Correct 0 ms 1084 KB Output is correct
28 Correct 0 ms 1084 KB Output is correct
29 Correct 0 ms 1084 KB Output is correct
30 Correct 0 ms 1084 KB Output is correct
31 Correct 0 ms 1084 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 1084 KB Output is correct
2 Correct 179 ms 1084 KB Output is correct
3 Correct 183 ms 1084 KB Output is correct
4 Correct 194 ms 1084 KB Output is correct
5 Correct 197 ms 1084 KB Output is correct
6 Correct 196 ms 1084 KB Output is correct
7 Correct 227 ms 1084 KB Output is correct
8 Correct 197 ms 1084 KB Output is correct
9 Correct 182 ms 1084 KB Output is correct
10 Correct 221 ms 1084 KB Output is correct
11 Correct 253 ms 1084 KB Output is correct
12 Correct 192 ms 1084 KB Output is correct
13 Correct 202 ms 1084 KB Output is correct
14 Correct 192 ms 1084 KB Output is correct
15 Correct 203 ms 1084 KB Output is correct
16 Correct 197 ms 1084 KB Output is correct
17 Correct 205 ms 1084 KB Output is correct
18 Correct 202 ms 1084 KB Output is correct
19 Correct 98 ms 1084 KB Output is correct
20 Correct 101 ms 1084 KB Output is correct
21 Correct 111 ms 1084 KB Output is correct
22 Correct 96 ms 1084 KB Output is correct
23 Correct 122 ms 1084 KB Output is correct
24 Correct 139 ms 1084 KB Output is correct
25 Correct 126 ms 1084 KB Output is correct
26 Correct 130 ms 1084 KB Output is correct
27 Correct 145 ms 1084 KB Output is correct
28 Correct 209 ms 1084 KB Output is correct
29 Correct 205 ms 1084 KB Output is correct
30 Correct 191 ms 1084 KB Output is correct
31 Correct 184 ms 1084 KB Output is correct
32 Correct 178 ms 1084 KB Output is correct
33 Correct 206 ms 1084 KB Output is correct
34 Correct 211 ms 1084 KB Output is correct
35 Correct 208 ms 1084 KB Output is correct