forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathG.cpp
More file actions
96 lines (78 loc) · 2.34 KB
/
G.cpp
File metadata and controls
96 lines (78 loc) · 2.34 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
int money;
int bound;
int nDrink;
int floatToInt(double x) {
return (int) (x*100 + 1e-3);
}
struct Drink {
string name;
int strength;
int value;
int cost;
int buy;
void read() {
cin >> name;
cin >> strength;
string t; cin >> t;
if (t == "1/1") value = 6;
else if (t == "1/2") value = 3;
else if (t == "1/3") value = 2;
value *= strength * 10;
double x; cin >> x;
cost = floatToInt(x);
buy = 0;
}
} drink[11];
int f[1011][1211];
int main() {
ios :: sync_with_stdio(false);
double m, b;
while (cin >> m >> b >> nDrink) {
bound = floatToInt(b) * 6 / 10;
money = floatToInt(m);
FOR(i,1,nDrink) drink[i].read();
memset(f, -1, sizeof f);
queue<int> qu;
queue<int> qv;
qu.push(0); qv.push(0);
f[0][0] = 0;
while (!qu.empty()) {
int u = qu.front(); qu.pop();
int v = qv.front(); qv.pop();
FOR(i,1,nDrink) {
int uu = u + drink[i].cost;
int vv = v + drink[i].value;
if (uu <= money && vv <= bound && f[uu][vv] < 0) {
f[uu][vv] = i;
qu.push(uu);
qv.push(vv);
}
}
}
if (f[money][bound] < 0) {
cout << "IMPOSSIBLE" << endl;
} else {
while (money || bound) {
int d = f[money][bound];
drink[d].buy++;
money -= drink[d].cost;
bound -= drink[d].value;
}
FOR(i,1,nDrink)
if (drink[i].buy)
cout << drink[i].name << ' ' << drink[i].buy << '\n';
}
}
}