-
Notifications
You must be signed in to change notification settings - Fork 0
/
00670.cpp
97 lines (95 loc) · 1.95 KB
/
00670.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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <bits/stdc++.h>
struct pos
{
int x,y;
};
using namespace std;
bool adj[105][105],seen[105];
int matchR[105];
pos bob[105], dog[105];
int n,m,l,dogRoute[105],result;
int dis(pos a, pos b)
{
return pow(a.x - b.x ,2) + pow(a.y-b.y, 2);
}
void creatAdj()
{
for(int i=1;i < n ;i++)
{
for(int j=1; j <=m ;j++)
{
double p = dis(bob[i-1],bob[i]);
double q1 = dis(bob[i-1],dog[j]);
double q2 = dis(bob[i],dog[j]);
if(sqrt(p)*2 >= sqrt(q1)+sqrt(q2))
{
adj[i-1][j] = true;
}
}
}
}
bool bpm(int s)
{
for(int i=1 ; i<= m ;i++)
{
if(adj[s][i] && !seen[i])
{
seen[i] = true;
if(dogRoute[i]== -1 || bpm(dogRoute[i]))
{
dogRoute[i] = s;
matchR[s] = i;
return true;
}
}
}
return false;
}
void maxBpm()
{
result = 0;
for(int i=0; i<n-1;i++)
{
memset(seen,0,sizeof(bool)*105);
if(bpm(i))
{
result++;
}
}
}
int main()
{
cin>>l;
while(l--)
{
memset(adj,0,sizeof(bool)*105*105);
fill_n(dogRoute,105,-1);
fill_n(matchR,105,-1);
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>> bob[i].x >> bob[i].y;
}
for(int i=1; i <= m; i++ )
{
cin>> dog[i].x >> dog[i].y;
}
creatAdj();
maxBpm();
cout<<result + n<<endl;
for(int i=0;i<n;i++)
{
if(i)
cout<<" ";
cout<<bob[i].x<<" "<<bob[i].y;
if(matchR[i] !=-1)
{
cout<<" "<<dog[matchR[i]].x<<" "<<dog[matchR[i]].y;
}
}
cout<<endl;
if(l)
cout<<endl;
}
return 0;
}