-
Notifications
You must be signed in to change notification settings - Fork 5
/
SlimeXResidentSlime.cpp
222 lines (191 loc) · 4.73 KB
/
SlimeXResidentSlime.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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
// BEGIN CUT HERE
/*
// SRM 506 Div2 Hard (1000)
問題
-文字で表された2次元のフィールドがある
-フィールドに勇者(あなた)とゾンビスライムが何匹かいる
-ゾンビスライムは1~9の数字で表され、数字のターン後に復活する
-ゾンビスライムと交差すると倒せる
-倒されたゾンビスライムに交差すると、復活してその場で倒したことになる
-全てのゾンビスライムを倒す瞬間が生み出せればOK
-最小のターン数を求める
*/
// END CUT HERE
#include <cmath>
#include <algorithm>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
using namespace std;
typedef long long LL;
typedef vector<int> IntVec;
typedef vector<LL> LLVec;
typedef vector<string> StrVec;
typedef set<int> IntSet;
typedef set<LL> LLSet;
typedef pair<int, int> II;
typedef vector<II> IIVec;
struct Slime {
II pos;
int life;
};
class SlimeXResidentSlime {
vector <string> fld;
int W;
int H;
int slimes;
Slime S[10];
int dist[10][10];
int get_dist(const II &st, const II &ed) {
if (st == ed) {
return -1;
}
int d[64][64];
memset(d, -1, sizeof(d));
II dirs[4] = {II(-1,0),II(1,0),II(0,-1),II(0,1)};
IIVec q;
d[st.second][st.first] = 0;
q.push_back(st);
while (q.size() > 0) {
IIVec nq;
int i, j;
for (i = 0; i < (int)q.size(); ++i) {
const II ¤t = q[i];
if (current == ed) {
return d[current.second][current.first];
}
for (j = 0; j < 4; ++j) {
int x = current.first + dirs[j].first;
int y = current.second + dirs[j].second;
if (x >= 0 && x < W && y >= 0 && y < H &&
d[y][x] < 0 && fld[y][x] != '#') {
nq.push_back(II(x, y));
d[y][x] = d[current.second][current.first] + 1;
}
}
}
q = nq;
}
return -1;
}
public:
int exterminate(vector <string> field) {
int res = -1;
slimes = 1;
fld = field;
W = field[0].length();
H = field.size();
int i, j;
for (i = 0; i < H; ++i) {
for (j = 0; j < W; ++j) {
if (field[i][j] == '$') {
S[0].pos = II(j, i);
S[0].life = 9999;
}
if (isdigit(field[i][j])) {
if (slimes >= 10) {
return -1;
}
S[slimes].pos = II(j, i);
S[slimes].life = field[i][j] - '0';
++slimes;
}
}
}
for (i = 0; i < slimes; ++i) {
for (j = 0; j < slimes; ++j) {
dist[i][j] = dist[j][i] = get_dist(S[i].pos, S[j].pos);
}
}
int seq[10];
for (i = 0; i < 10; ++i) {
seq[i] = i;
}
do {
int t = 0;
for (i = slimes-1; i >= 1; --i) {
int d = dist[seq[i-1]][seq[i]];
if (d < 0) {
t = -1;
break;
}
t += d;
if (t >= S[seq[i-1]].life) {
t = -1;
break;
}
}
if (t > 0) {
res = res < 0 ? t : min(res, t);
}
} while (next_permutation(seq +1, seq +slimes));
return res;
}
// BEGIN CUT HERE
private:
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
public:
void run_test(int Case) {
int n = 0;
// test_case_0
if ((Case == -1) || (Case == n)){
string Arr0[] =
{
"#1$",
".2."};
int Arg1 = 3;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, exterminate(Arg0));
}
n++;
// test_case_1
if ((Case == -1) || (Case == n)){
string Arr0[] = {
"$",
"1",
"1"};
int Arg1 = -1;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, exterminate(Arg0));
}
n++;
// test_case_2
if ((Case == -1) || (Case == n)){
string Arr0[] = {
"$124"};
int Arg1 = 5;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, exterminate(Arg0));
}
n++;
// test_case_3
if ((Case == -1) || (Case == n)){
string Arr0[] = {"$.#2"
,"#..1"};
int Arg1 = 6;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, exterminate(Arg0));
}
n++;
if ((Case == -1) || (Case == n)){
string Arr0[] = {"$123456789"};
int Arg1 = 17;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, exterminate(Arg0));
}
n++;
}
// END CUT HERE
};
// BEGIN CUT HERE
int main() {
SlimeXResidentSlime ___test;
___test.run_test(-1);
return 0;
}
// END CUT HERE