-
Notifications
You must be signed in to change notification settings - Fork 34
/
1046-Rider.cpp
166 lines (122 loc) · 2.3 KB
/
1046-Rider.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
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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
#include <iostream>
#include <string.h>
#include <limits.h>
#include <math.h>
using namespace std;
int m;
int n;
int p;
int r;
int f;
int d;
char a[15][15];
bool vis[15][15];
int dis[110][110];
int explore(int i, int j,int sofar)
{
int temp;
temp = INT_MAX;
if(i < 0 or i >= m or j < 0 or j >= n) {
return INT_MAX;
}
if(dis[p * n + r][i * n + j] > sofar) {
dis[p * n + r][i * n + j] = sofar;
}
if(vis[i+1][j+2] == 0) {
vis[i+1][j+2] = 1;
temp = min(explore(i+1, j+2,sofar+1), temp);
vis[i+1][j+2] = 0;
}
if(vis[i+1][j-2] == 0) {
vis[i+1][j-2] = 1;
temp = min(explore(i+1, j-2,sofar+1), temp);
vis[i+1][j-2] =0;
}
if(vis[i-1][j+2] == 0) {
vis[i-1][j+2] = 1;
temp = min(explore(i-1, j+2,sofar+1), temp);
vis[i-1][j+2] = 0;
}
if(vis[i-1][j-2] == 0) {
vis[i-1][j-2] = 1;
temp = min(explore(i-1, j-2,sofar+1), temp);
vis[i-1][j-2] = 0;
}
if(vis[i+2][j+1] == 0) {
vis[i+2][j+1] = 1;
temp = min(explore(i+2, j+1,sofar+1), temp);
vis[i+2][j+1] = 0;
}
if(vis[i+2][j-1] == 0) {
vis[i+2][j-1] = 1;
temp = min(explore(i+2, j-1,sofar+1), temp);
vis[i+2][j-1] = 0;
}
if(vis[i-2][j+1] == 0) {
vis[i-2][j+1] = 1;
temp = min(explore(i-2, j+1,sofar+1), temp);
vis[i-2][j+1] = 0;
}
if(vis[i-2][j-1] == 0) {
vis[i-2][j-1] = 1;
temp = min(explore(i-2, j-1,sofar+1), temp);
vis[i-2][j-1] = 0;
}
}
int main()
{
int t;
int k;
int temp;
int ans;
cin >> t;
for (int cs = 1; cs <= t; cs++) {
cin >> m;
cin >> n;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
memset(dis, 0, sizeof(dis));
for (int i = 0; i < m * n; i++) {
for (int j = 0; j < n * m; j++) {
dis[i][j] = INT_MAX;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
memset(vis, 0, sizeof(vis));
p = i;
r = j;
if(a[i][j] != '.') {
vis[i][j] = true;
explore(i, j, 0);
vis[i][j] = false;
}
}
}
ans = INT_MAX;
int p;
int pp;
for (int i = 0; i < m * n; i++) {
temp = 0;
for (int j = 0; j < m * n; j++) {
p = j / n;
pp = j % n;
if(a[p][pp] != '.') {
if(dis[j][i] != INT_MAX) {
temp += dis[j][i];
}
else {
temp = INT_MAX;
break;
}
}
}
ans = min(ans, temp);
}
cout << ans << endl;
}
}
}