| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 20141 |
2016-02-27T23:59:14 Z |
hongjun7 |
Min-cost GCD (GA9_mcg) |
C++14 |
|
1000 ms |
1224 KB |
#include <cstdio>
#include <vector>
#include <map>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
using namespace std;
typedef long long ll;
static char _buffer[1024];
static int _currentChar = 0;
static int _charsNumber = 0;
static inline int _read() {
if (_charsNumber < 0) {
exit(1);
}
if (!_charsNumber || _currentChar == _charsNumber) {
_charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), stdin);
_currentChar = 0;
}
if (_charsNumber <= 0) {
return -1;
}
return _buffer[_currentChar++];
}
static inline ll _readll() {
int c, s; ll x;
c = _read();
while (c <= 32) c = _read();
x = 0;
s = 1;
if (c == '-') {
s = -1;
c = _read();
}
while (c > 32) {
x *= 10;
x += c - '0';
c = _read();
}
if (s < 0) x = -x;
return x;
}
ll a, b, p, q;
map <ll, ll> d;
ll lim2 = 1e18, lim = 1e15 + 7;
inline ll f(ll x, ll y) {
if (x == 0 || y == 0) return 0;
ll X = x*lim + y;
if (d.count(X)) return d[X];
ll d1 = f(y, x%y) + p, d2 = lim2, m;
if (x >= y) {
m = x / y;
if (m <= d1 / q) d2 = f(x - m*y, y) + m*q;
}
else {
m = y / x;
if (m <= d1 / q) d2 = f(x, y - m*x) + m*q;
}
if (d1 > d2) d1 = d2;
d[X] = d1;
return d1;
}
int main() {
int T;
for (scanf("%d", &T); T--; ) {
a = _readll(); b = _readll(); p = _readll(); q = _readll();
d.clear();
printf("%lld\n", f(a, b));
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
101 ms |
1224 KB |
Output is correct |
| 2 |
Correct |
152 ms |
1224 KB |
Output is correct |
| 3 |
Correct |
182 ms |
1224 KB |
Output is correct |
| 4 |
Correct |
187 ms |
1224 KB |
Output is correct |
| 5 |
Correct |
89 ms |
1224 KB |
Output is correct |
| 6 |
Correct |
178 ms |
1224 KB |
Output is correct |
| 7 |
Correct |
193 ms |
1224 KB |
Output is correct |
| 8 |
Correct |
104 ms |
1224 KB |
Output is correct |
| 9 |
Correct |
172 ms |
1224 KB |
Output is correct |
| 10 |
Correct |
144 ms |
1224 KB |
Output is correct |
| 11 |
Correct |
164 ms |
1224 KB |
Output is correct |
| 12 |
Correct |
95 ms |
1224 KB |
Output is correct |
| 13 |
Correct |
158 ms |
1224 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
1224 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1224 KB |
Output is correct |
| 3 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1224 KB |
Output is correct |
| 5 |
Correct |
6 ms |
1224 KB |
Output is correct |
| 6 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 7 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 8 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 9 |
Correct |
3 ms |
1224 KB |
Output is correct |
| 10 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 11 |
Correct |
3 ms |
1224 KB |
Output is correct |
| 12 |
Correct |
5 ms |
1224 KB |
Output is correct |
| 13 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 15 |
Correct |
1 ms |
1224 KB |
Output is correct |
| 16 |
Correct |
2 ms |
1224 KB |
Output is correct |
| 17 |
Correct |
2 ms |
1224 KB |
Output is correct |
| 18 |
Correct |
1 ms |
1224 KB |
Output is correct |
| 19 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 20 |
Correct |
8 ms |
1224 KB |
Output is correct |
| 21 |
Correct |
4 ms |
1224 KB |
Output is correct |
| 22 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 23 |
Correct |
8 ms |
1224 KB |
Output is correct |
| 24 |
Correct |
5 ms |
1224 KB |
Output is correct |
| 25 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 26 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 27 |
Correct |
7 ms |
1224 KB |
Output is correct |
| 28 |
Correct |
8 ms |
1224 KB |
Output is correct |
| 29 |
Correct |
6 ms |
1224 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1224 KB |
Output is correct |
| 31 |
Correct |
5 ms |
1224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1000 ms |
1224 KB |
Program timed out |
| 2 |
Halted |
0 ms |
0 KB |
- |
