-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbuttonbashing.cpp
73 lines (64 loc) · 1.4 KB
/
buttonbashing.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
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <climits>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
vector<int> W;
vector<int> B;
vector<int> nb(int x) {
vector<int> V;
for (auto& i:B) {
int y = x+i;
y = max(0,y);
y = min(3600,y);
V.push_back(y);
}
return V;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("1.in","r",stdin);
int t, n, target, x;
cin >> t;
while (t--) {
cin >> n >> target;
W.assign(3601, INT_MAX);
B.assign(n,0);
for (int i=0; i<n; i++) {
cin >> B[i];
}
queue<int> Q;
Q.push(0); W[0] = 0;
while (!Q.empty()) {
int u = Q.front(); Q.pop();
int uw = W[u];
uw++;
for (auto& v:nb(u)) {
if (uw >= W[v]) continue;
W[v] = uw;
Q.push(v);
}
}
for (int i=target; i<W.size(); i++) {
if (W[i] != INT_MAX) {
cout << W[i] << ' ' << i-target << endl;
break;
}
}
}
}