/
Q10306.cpp
50 lines (44 loc) · 1.23 KB
/
Q10306.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
#include <stdio.h>
#include <string.h>
#include <math.h>
struct node {
int con,info,cnt;
} coin[50],q[500000];
char used[500][500];
int n,m;
int main() {
int t;
int i,j,x,y,tmp;
int head,tail;
scanf("%d",&t);
while(t--) {
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d%d",&coin[i].con,&coin[i].info);
memset(used,0,sizeof(used));
head = tail = 0;
for(i=0;i<n;i++) {
q[tail] = coin[i];
q[tail].cnt = 1;
used[coin[i].con][coin[i].info] = 1;
tail++;
}
while(head < tail) {
x = q[head].con;
y = q[head].info;
tmp = x*x+y*y;
if(tmp == m*m) break;
for(i=0;i<n;i++)
if(x+coin[i].con <= m && y+coin[i].info <= m && used[x+coin[i].con][y+coin[i].info] == 0) {
used[x+coin[i].con][y+coin[i].info] = 1;
q[tail++] = (node){x+coin[i].con,y+coin[i].info,q[head].cnt+1};
}
head++;
}
if(head >= tail)
puts("not possible");
else
printf("%d\n",q[head].cnt);
}
return 0;
}