oj.uz

Submission #12079

# Submission time Handle Problem Language Result Execution time Memory
12079 2014-12-20T23:37:42 Z tncks0121 Min-cost GCD (GA9_mcg) C++14
100 / 100
 244 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)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);
    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 73 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 62 ms 1084 KB Output is correct
4 Correct 71 ms 1084 KB Output is correct
5 Correct 80 ms 1084 KB Output is correct
6 Correct 65 ms 1084 KB Output is correct
7 Correct 71 ms 1084 KB Output is correct
8 Correct 70 ms 1084 KB Output is correct
9 Correct 80 ms 1084 KB Output is correct
10 Correct 75 ms 1084 KB Output is correct
11 Correct 79 ms 1084 KB Output is correct
12 Correct 72 ms 1084 KB Output is correct
13 Correct 70 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 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 1 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
11 Correct 0 ms 1084 KB Output is correct
12 Correct 1 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 2 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 1 ms 1084 KB Output is correct
23 Correct 0 ms 1084 KB Output is correct
24 Correct 0 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 1 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 187 ms 1084 KB Output is correct
2 Correct 193 ms 1084 KB Output is correct
3 Correct 192 ms 1084 KB Output is correct
4 Correct 193 ms 1084 KB Output is correct
5 Correct 189 ms 1084 KB Output is correct
6 Correct 163 ms 1084 KB Output is correct
7 Correct 184 ms 1084 KB Output is correct
8 Correct 168 ms 1084 KB Output is correct
9 Correct 192 ms 1084 KB Output is correct
10 Correct 176 ms 1084 KB Output is correct
11 Correct 205 ms 1084 KB Output is correct
12 Correct 155 ms 1084 KB Output is correct
13 Correct 188 ms 1084 KB Output is correct
14 Correct 197 ms 1084 KB Output is correct
15 Correct 199 ms 1084 KB Output is correct
16 Correct 197 ms 1084 KB Output is correct
17 Correct 212 ms 1084 KB Output is correct
18 Correct 200 ms 1084 KB Output is correct
19 Correct 119 ms 1084 KB Output is correct
20 Correct 107 ms 1084 KB Output is correct
21 Correct 119 ms 1084 KB Output is correct
22 Correct 110 ms 1084 KB Output is correct
23 Correct 116 ms 1084 KB Output is correct
24 Correct 126 ms 1084 KB Output is correct
25 Correct 118 ms 1084 KB Output is correct
26 Correct 125 ms 1084 KB Output is correct
27 Correct 133 ms 1084 KB Output is correct
28 Correct 189 ms 1084 KB Output is correct
29 Correct 244 ms 1084 KB Output is correct
30 Correct 201 ms 1084 KB Output is correct
31 Correct 194 ms 1084 KB Output is correct
32 Correct 0 ms 1084 KB Output is correct
33 Correct 222 ms 1084 KB Output is correct
34 Correct 199 ms 1084 KB Output is correct
35 Correct 206 ms 1084 KB Output is correct