7139 Dragon slayer

#include
#include
#include
#include
using namespace std;
typedef pair<int, int>PII;
using namespace std;
const int N = 1e6 + 10;
int dx[4] = { 1,-1,0,0 }, dy[4] = {0,0,-1,1};
struct edge
{
	int x1, y1, x2, y2;
}w[N];
bool st[20][20];
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int n, m, k;
		cin >> n >> m >> k;
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		
		for (int i = 1; i <= k; i++)
		{
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			w[i] = {a,b,c,d};
		}

		int cnt = 0;
		int res = -1;
		for (int i = 0; i < (1 << k); i++)
		{
			cnt = 0;
			memset(st, false, sizeof st);
			vector<PII>heng[20];
			vector<PII>shu[20];
			for (int j = 0; j < k; j++)
			{
				if ((1 << j) & i)
				{
					cnt++;
					int a = w[j+1].x1;
					int b = w[j+1].y1;
					int c = w[j+1].x2;
					int d = w[j+1].y2;
					if (a == c) // 横边
					{
						heng[a].push_back({min(b, d), max(b, d)});
					}
					if (b == d) // 竖边
					{
						shu[b].push_back({min(a, c), max(a, c)});
					}
				}
			}
			bool flag = false;
			queue<PII>q;
			q.push({x1,y1});
			st[x1][y1] = true;
			while (!q.empty())
			{
				PII pos = q.front();
				q.pop();
				if (pos.first == x2 && pos.second == y2)
				{
					flag = true;
					break;
				}
				for (int i = 0; i < 4; i++)
				{
					int a = pos.first + dx[i];
					int b = pos.second + dy[i];
					if (a < 0 || a >= n || b < 0 || b >= m)
					{
						continue;
					}
					if (st[a][b])
					{
						continue;
					}
					bool qiang = false; // 是否有墙
					if (a == pos.first) // 横着走
					{
						int yy = max(b, pos.second);
						if (!shu[yy].empty())
						{
							for (auto p : shu[yy])
							{
								int l = p.first;
								int r = p.second;
								if (l <= a && r > a)
								{
									qiang = true;
									break;
								}
							}
						}
					}

					if (b == pos.second) // 竖着走
					{
						int xx = max(a, pos.first);
						if (!heng[xx].empty())
						{
							for (auto p : heng[xx])
							{
								int l = p.first;
								int r = p.second;
								if (l <= b && b < r)
								{
									qiang = true;
									break;
								}
							}
						}
					}

					if (qiang)
					{
						continue;
					}

					q.push({a,b});
					st[a][b] = true;
				}
			}
			if (flag)
			{
				res = max(res, cnt);
			}
		}
		if (res == -1) cout << -1 << endl;
		else cout << k - res << endl;   //结果
		
	}
	return 0;
}
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141