forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathninepacks.cpp
74 lines (66 loc) · 1.41 KB
/
ninepacks.cpp
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
#include <iostream>
#include <vector>
using namespace std;
int main() {
int inf = 1 << 29;
int size;
vector<int> h(100002, inf);
vector<int> b(100002, inf);
h[0] = 0;
b[0] = 0;
// Find all combinations of hotdogs
cin >> size;
for(int i = 0; i < size; i++) {
int num;
cin >> num;
for(int j = h.size()-num-1; j >= 0; j--) {
if(h[j] < h[j+num]) {
h[j+num] = h[j]+1;
}
}
}
// Find all combinations of buns
cin >> size;
for(int i = 0; i < size; i++) {
int num;
cin >> num;
for(int j = b.size()-num-1; j >= 0; j--) {
if(b[j] < b[j+num]) {
b[j+num] = b[j]+1;
}
}
}
// Get answer
int best = inf;
for(int i = 1; i < h.size(); i++) {
if(h[i] + b[i] < best) {
best = h[i] + b[i];
}
}
/*
for(int i = 0; i < 25; i++) {
if(h[i] >= inf/2) {
cout << "-1" << " ";
}
else {
cout << h[i] << " ";
}
}
cout << endl;
for(int i = 0; i < 25; i++) {
if(b[i] >= inf/2) {
cout << "-1" << " ";
}
else {
cout << b[i] << " ";
}
}
cout << endl;
*/
// Print result
if(best >= inf/2) {
cout << "impossible" << endl;
return 0;
}
cout << best << endl;
}